2020-07-03

    技术2024-10-12  47

    #大佬们我查找不到尾节点的信息是为什么求帮忙# 标题 #include<stdio.h> #include<malloc.h> #include<string.h> typedef struct m { int nembr; char kname[10];//课程名称 struct m *next; }kch; int g, i = 0, a, f, v = 0; kch create()//创建链表 { kch pend, pnew=NULL, phead=NULL; pend = pnew = (kch)malloc(sizeof(kch)); phead = NULL; printf(“测试”); scanf("%s", &pnew->kname); scanf("%d", &pnew->nembr); i = 0; printf(“数”); scanf("%d", &g); while (i < g) { if (phead == NULL) { phead = pnew; } else { pend->next = pnew; } i++; pend = pnew; pnew = (kch)malloc(sizeof(kch)); printf(“测试”); scanf("%s", &pnew->kname); scanf("%d", &pnew->nembr); } return phead; } void fine(kch *head)//查找学生信息 { kch *p; p = NULL; p = head; char w[20], d[20], z[20];//学号或姓名,宿舍号,学号 int i = 0; while (p != NULL) { printf(“输入1查找学生基本信息\n输入2查找学生宿舍基本信息\n输入3查找学生成绩信息\n”); scanf("%d", &i); switch (i) { case(1) : { printf(“请输入您要查找的学生的姓名或学号\n”); scanf("%s", &w); while (p != NULL && strcmp(w, p->kname))//指针不为空 { p = p->next; } if (p == NULL) { printf(“查找失败!”); } else { printf("——————————学生信息————————————\n"); printf(“姓名%s\t”, p->kname); printf("——————————————————————————\n"); } break; } } } } int main() { int i = 0; kch *head; head = NULL; head = create(); fine(head); return 0; }

    Processed: 0.011, SQL: 9