c/school/ch09_9-12.c · 1705 字节 · 下载原文
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*
101 Ma 1 20
102 Li 0 23
103 Zhang 1 19
104 Wang 1 19
0 as 2 2
*/
// 定义双向链表结构体
typedef struct LinkList{
int num,sex,age;
char name[10];
struct LinkList* next;
struct LinkList* front;
}LinkList;
LinkList* init(){
LinkList* node=(LinkList*)malloc(sizeof(LinkList));
node->num=0;
node->sex=0;
node->age=0;
strcpy(node->name,"hello");
node->next=NULL;
node->front=NULL;
return node;
}
void del(LinkList* H,int age){
LinkList* node1=H->next,*node2;
while(node1){
if(node1->age==age){
node2=node1;
node1->front->next=node1->next;
if(node1->next)node1->next->front=node1->front;
node1=node1->next;
free(node2);
}
else node1=node1->next;
}
}
void print(LinkList* H){
LinkList* node=H->next;
while(node){
printf("%d %s %d %d\n",node->num,node->name,node->sex,node->age);
node=node->next;
}
}
int main(){
LinkList* Head,*node1,*node2;
Head=init();
int num,sex,age;
char name[10];
node2=Head;
while(scanf("%d %s %d %d",&num,name,&sex,&age),num){
node1=(LinkList*)malloc(sizeof(LinkList));
node1->num=num;
strcpy(node1->name,name);
node1->sex=sex;
node1->age=age;
node1->next=node2->next;
node1->front=node2;
node2->next=node1;
node2=node2->next;
}
puts("输入要删除的年龄(输入0结束)");
while(scanf("%d",&age),age){
del(Head,age);
print(Head);
puts("输入要删除的年龄(输入0结束)");
}
return 0;
}