⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 link age delete.c

📁 排序we 4536458909可 0-=- 8捌认为
💻 C
字号:
#include "stdio.h"
#include "string.h"
#include "stdlib.h"
#define LEN sizeof(struct student)
struct student
{  char num[6];
   char name[8];
   char sex[2];
   int age;
   struct  student  *next;
} stu[10];

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;
	}
	/*set up link*/
	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;
	}
	/*delete*/
	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;
	}
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -