编写程序，建立一动态链表，其中包含学生学号，姓名，年龄，输入一个学生学号删除相对应的节点

最新推荐文章于 2023-04-09 23:18:15 发布

小木猿

最新推荐文章于 2023-04-09 23:18:15 发布

阅读量637

点赞数 1

分类专栏：学生类文章标签：链表数据结构

本文链接：https://blog.csdn.net/m0_59073956/article/details/127423185

版权

学生类专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<malloc.h>
#define LEN sizeof(struct student)
struct student {
	char num[6];
	char name[8];
	char sex[2];
	int age;
	struct student* next;
}stu[10];
int main() {
	struct student* p, * pt, * head;
	int i, length, iage, flag=1;
	int find = 0;
	while (flag==1) {
		printf("input length of list(<10):");
		scanf("%d",&length);
		if (length < 10)
			flag = 0;
	}
	for (i = 0; i < length; i++) {
		p = (struct student*)malloc(LEN);
		if (i == 0)
			head = pt = p;
		else
			pt->next = p;
		pt = p;
		printf("No.:");
		scanf("%s", &p->num);
		printf("name:");
		scanf("%s",&p->name);
		printf("sex:");
		scanf("%s",&p->sex);
		printf("age:");
		scanf("%d",&p->age);

	}
	p->next = NULL;
	p = head;
	printf("\n No. name sex age\n");
	while (p != NULL) {
		printf(" % 4s%8s%6s%6d\n",p->num,p->name,p->sex,p->age);
		p = p->next;
	}
	printf("input age:");
	scanf("%d",&iage);
	pt = head;
	p = pt;
	if (pt->age == iage) {
		p = pt->next;
		head = pt = p;
		find = 1;
	}
	else
		pt = pt->next;
	while (pt != NULL) {
		if (pt->age == iage) {
			p->next = pt->next;
			find = 1;
		}
		else
			p = pt;
		pt = pt->next;
	}
	if (!find) 
		printf("not found %d.",iage);
		p = head;
		printf("\n No. name sex age\n");
		while (p!=NULL) {
			printf("%4s%8s",p->num,p->name);
			printf("%6s%6d\n",p->sex,p->age);
			p = p->next;
		}
		return 0;
}