使用链表实现简单的学生信息录入系统.pdf

//双链表的基本实现 #include stdio.h #include malloc.h #include stdlib.h #include string.h typedef struct STUDENT { long sId; //学生学号 char sName[20]; //学生姓名 struct STUDENT *pNext; //指向下一个学生 struct STUDENT *pPre; //指向前一个学生 }student; //创建链表 student * CreateLink() { student *pHead; //链表头 pHead = (student *)malloc(sizeof(student)); pHead-pNext = NULL; pHead-pPre = NULL; student *pTemp; //定义指针，始终指向最后一个 pTemp = (student *)malloc(sizeof(student)); pTemp = pHead; int iCount = 0; student *p; while(1) { p = (student *)malloc(sizeof(student)); //动态创建节点 iCount++; printf(请输入第%d 个学生的学号(输入 0 结束):,iCount); scanf(%ld,p-sId); if (p-sId == 0) break; printf(请输入该学生的姓名:); scanf(%s,p-sName); pTemp-pNext = p; p-pPre = pTemp; p-pNext = NULL; pTemp = pTemp-pNext; pTemp-pNext = NULL; //将最后一个指针指向空 } return pHead; } //查找学生 void FindStudentLink(student *pHead,long iId) { student *pTemp; pTemp = pHead-pNext; int ifFind = 0; if(pHead-pNext == NULL) printf(链表为空，无法查找!\n); while(pTemp != NULL) { if(pTemp-sId == iId) { printf(学号为%ld 的学生信息:\n,iId); printf( 姓名为:%s\n,pTemp-sName); ifFind = 1; } pTemp = pTemp-pNext; } if(ifFind == 0) printf(没有这个学号!\n); } //插入学生 /* //在指点的位置 i 前面插入学生 int InsertLink(student *pHead,int i) { student *pTemp; pTemp=pHead-pNext; student *p; //要插入的学生 p = (student *)malloc(sizeof(student)); if (p == NULL) return 0; printf(请输入你想要插入学生的学号:); scanf(%ld,p-sId); printf(请输入你想要插入学生的姓名:); scanf(%s,p-sName); int j=1; if(pHead == NULL) { if (i == 0) { pHead-pNext = p; p-pNext = NULL; } else { printf(无法插入!\n); return 0; } } while((j i-1) (pTemp != NULL)) { pTemp = pTemp-pNext; j++; } if(pTemp ==