编写程序:建立一个学生数据链表,每个节点的信息包括如下内容:学号,姓名,性别年龄专业。对链表做如下处理。输入一个学号(专业),如果链表中的节点包含此学号(专业),则删去该结点。

#include <iostream>
using namespace std;


struct student
{
char name[20];
char s_number[10];
char gender[3];
int age;
char major[10];
struct student* next;
};


student* CREATE_LIST();
int operation(student* head);
int PRINT_LIST(student* head);
student* DROP_F_NUMBER(student* head);
student* DROP_F_MAJOR(student* head);
student* DROP_LIST(student* head);


int main()
{
student* head = CREATE_LIST();
operation(head);
return 0;
}


student*  CREATE_LIST()
{
int number = 0;
student* q = new student, *head = q;


while (1)
{
printf("有多少名学生?\n请输入:");
scanf("%d", &number);
if (number <= 0) printf("\n请输入正确的人数!\n");
else break;
}


for (int n = 0;; n++)
{
printf("---------------------------------------------------\n");
printf("\n请输入学生的姓名:");
scanf("%s", q->name);
printf("\n请输入学生的学号:");
scanf("%s", q->s_number);
printf("\n请输入学生的性别:");
scanf("%s", q->gender);
printf("\n请输入学生的年龄:");
scanf("%d", &q->age);
printf("\n请输入学生的专业:");
scanf("%s", q->major);
if (n == number - 1)
{
q->next = NULL;
break;
}
student* p = new student;
q->next = p;
q = p;
}


return head;
}


int operation(student* head)
{
int x;


while (1)
{
printf("---------------------------------------------------\n");
printf("1.打印所有数据\n2.按照学号删除数据\n3.按照专业删除数据\n4.退出\n");
printf("请输入要操作什么:");
scanf("%d", &x);


switch (x)
{
case 1:
PRINT_LIST(head);
break;
case 2:
head = DROP_F_NUMBER(head);
break;
case 3:
head = DROP_F_MAJOR(head);
break;
case 4:
DROP_LIST(head);
return 0;
default:
printf("请输入正确的选择!\n");
break;
}


}
}


int PRINT_LIST(student* head)
{
if (head == NULL)
{
printf("---------------------------------------------------\n");
printf("没有学生信息!\n");
return 0;
}
printf("---------------------------------------------------\n");
printf("姓名:\t学号:\t\t性别:\t年龄:\t专业:\n");
while (head != NULL)
{
printf("%s\t%s\t%s\t%d\t%s\n",
head->name,
head->s_number,
head->gender,
head->age,
head->major);
head = head->next;
}
return 0;
}


student* DROP_F_NUMBER(student* head)
{
if (head == NULL)
{
printf("---------------------------------------------------\n");
printf("没有学生信息。无法删除!\n");
return 0;
}


student Z, *p = &Z;
char s_number[10];


printf("---------------------------------------------------\n");
printf("请输入要删除的学号:");
scanf("%s", s_number);


for (p->next = head; p->next != NULL; p = p->next)
{
if (strcmp((p->next)->s_number, s_number) == 0)
{
student* q = p->next;
p->next = (p->next)->next;
delete q;
printf("已删除学号为:%s的学生信息。\n", s_number);
break;
}
}


return Z.next;
}


student* DROP_F_MAJOR(student* head)
{
if (head == NULL)
{
printf("---------------------------------------------------\n");
printf("没有学生信息。无法删除!\n");
return 0;
}


student Z, *p = &Z;
int x = 0;
char major[10];


printf("---------------------------------------------------\n");
printf("请输入要删除的专业:");
scanf("%s", major);




for (p->next = head; p->next != NULL;)
{
if (strcmp((p->next)->major, major) == 0)
{
x = 1;
student* q = p->next;
p->next = (p->next)->next;
delete q;
continue;
}
p = p->next;


}
if (x == 1)printf("已删除所有专业为:%s的学生信息。\n", major);
else printf("没有专业为:%s的学生!\n", major);
return Z.next;
}


student* DROP_LIST(student* head)
{
student* p = head;
while (head != NULL)
{
head = head->next;
delete p;
p = head;
}
return 0;
}
  • 8
    点赞
  • 23
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
好的,下面是建立链表的代码: ```c #include <stdio.h> #include <stdlib.h> #include <string.h> // 定义链表节点结构体 typedef struct student { int number; char name[20]; char sex; int age; struct student *next; } Student; // 初始化链表 Student *initList() { Student *head = (Student*)malloc(sizeof(Student)); head->next = NULL; return head; } // 添加节点 void addNode(Student *head, int number, char name[], char sex, int age) { Student *p = (Student*)malloc(sizeof(Student)); p->number = number; strcpy(p->name, name); p->sex = sex; p->age = age; p->next = NULL; Student *q = head; while (q->next != NULL) { q = q->next; } q->next = p; } // 删除节点 void deleteNode(Student *head, int number) { Student *p = head->next; Student *q = head; while (p != NULL) { if (p->number == number) { q->next = p->next; free(p); return; } q = p; p = p->next; } } // 修改节点 void modifyNode(Student *head, int number, char name[], char sex, int age) { Student *p = head->next; while (p != NULL) { if (p->number == number) { strcpy(p->name, name); p->sex = sex; p->age = age; return; } p = p->next; } } // 查询节点 void searchNode(Student *head, int number) { Student *p = head->next; while (p != NULL) { if (p->number == number) { printf("学号:%d\n", p->number); printf("姓名:%s\n", p->name); printf("性别:%c\n", p->sex); printf("年龄:%d\n", p->age); return; } p = p->next; } printf("查无此人!\n"); } // 输出链表 void printList(Student *head) { Student *p = head->next; while (p != NULL) { printf("学号:%d\n", p->number); printf("姓名:%s\n", p->name); printf("性别:%c\n", p->sex); printf("年龄:%d\n", p->age); printf("\n"); p = p->next; } } int main() { Student *head = initList(); addNode(head, 1001, "小明", 'M', 18); addNode(head, 1002, "小红", 'F', 19); addNode(head, 1003, "小刚", 'M', 20); printList(head); deleteNode(head, 1002); printList(head); modifyNode(head, 1001, "小明明", 'M', 19); printList(head); searchNode(head, 1003); return 0; } ``` 这个程序实现了链表的基本操作,包括初始化链表、添加节点、删除节点、修改节点、查询节点和输出链表。你可以在此基础上进行修改,实现你所需的功能。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值