建立一个链表,每个结点包括:学号、姓名、性别、年龄。输入一个年龄,如果链表中的结点所包含的年龄等于此年龄,则将此结点删去。
方法一:
#include <stdio.h>
#include <stdlib.h>
//声明结构体struct Student
struct Student
{
int num;
char name[20];
char sex;
int age;
struct Student* prev;
struct Student* next;
};
struct Student* input(int);//声明输入函数
void append(struct Student**, struct Student*);//声明建立链表
void del_list(struct Student**, int);//声明删除一个链表中多个节点函数(由age)
struct Student* del_item(struct Student**, struct Student*);//声明删除单个节点函数
void print(struct Student*);//声明输出函数
int main()
{
struct Student* a; //定义指针a
a = input(3); //调用输入函数,输入a链表
int age;
printf("Please enter delete age: ");
scanf("%d", &age);
del_list(&a, age); //从a中删除b
print(a);
return 0;
}
//输入函数
struct Student* input(int n)
{
struct Student* head = NULL, * stu;
int i = 0;
for (i = 1; i <= n; i++)//动态初始化链表
{
stu = (struct Student*)malloc(sizeof(struct Student));
printf("Please enter No.%d student info: ", i);
scanf("%d %s %c %d", &stu->num, stu->name, &stu->sex, &stu->age);
append(&head, stu);
}
printf("\n");
return head;
}
//建立链表操作
void append(struct Student** head2, struct Student* stu)
{
stu->next = NULL;
if (*head2 == NULL)
{
stu->prev = NULL;
*head2 = stu;
}
else
{
struct Student* p = *head2;
while (p->next != NULL)
p = p->next;
p->next = stu;
stu->prev = p;
}
}
//删除一个链表中多个节点函数(由age)
void del_list(struct Student** head, int age)
{
struct Student* p;
for (p = *head; p != NULL; )
{
if (p->age == age)
p = del_item(head, p);
else
p = p->next;
}
}
//删除单个节点函数
struct Student* del_item(struct Student** head, struct Student* p)
{
if (p == *head)
*head = p->next;
if (p->prev != NULL)
p->prev->next = p->next;
if (p->next != NULL)
p->next->prev = p->prev;
struct Student* next = p->next;
return next;
}
//输出函数
void print(struct Student* stu)
{
if (stu == NULL)
printf("Empty Linked list.\n");
else
{
struct Student* p;
for (p = stu; p != NULL; p = p->next)
{
printf("%d %s %c %d\n", p->num, p->name, p->sex, p->age);
}
}
}
在VS2019下,需将源文件的scanf做些修改:
#include <stdio.h>
#include <stdlib.h>
//声明结构体struct Student
struct Student
{
int num;
char name[20];
char sex;
int age;
struct Student* prev;
struct Student* next;
};
struct Student* input(int);//声明输入函数
void append(struct Student**, struct Student*);//声明建立链表
void del_list(struct Student**, int);//声明删除一个链表中多个节点函数(由age)
struct Student* del_item(struct Student**, struct Student*);//声明删除单个节点函数
void print(struct Student*);//声明输出函数
int main()
{
struct Student* a; //定义指针a
a = input(3); //调用输入函数,输入a链表
int age;
printf("Please enter delete age: ");
scanf_s("%d", &age);
del_list(&a, age); //从a中删除b
print(a);
return 0;
}
//输入函数
struct Student* input(int n)
{
struct Student* head = NULL, * stu;
int i = 0;
for (i = 1; i <= n; i++)//动态初始化链表
{
stu = (struct Student*)malloc(sizeof(struct Student));
printf("Please enter No.%d student info: ", i);
scanf_s("%d %s %c %d", &stu->num, stu->name, (unsigned int)sizeof(stu->name), &stu->sex, (unsigned int)sizeof(stu->sex), &stu->age);
append(&head, stu);
}
printf("\n");
return head;
}
//建立链表操作
void append(struct Student** head2, struct Student* stu)
{
stu->next = NULL;
if (*head2 == NULL)
{
stu->prev = NULL;
*head2 = stu;
}
else
{
struct Student* p = *head2;
while (p->next != NULL)
p = p->next;
p->next = stu;
stu->prev = p;
}
}
//删除一个链表中多个节点函数(由age)
void del_list(struct Student** head, int age)
{
struct Student* p;
for (p = *head; p != NULL; )
{
if (p->age == age)
p = del_item(head, p);
else
p = p->next;
}
}
//删除单个节点函数
struct Student* del_item(struct Student** head, struct Student* p)
{
if (p == *head)
*head = p->next;
if (p->prev != NULL)
p->prev->next = p->next;
if (p->next != NULL)
p->next->prev = p->prev;
struct Student* next = p->next;
return next;
}
//输出函数
void print(struct Student* stu)
{
if (stu == NULL)
printf("Empty Linked list.\n");
else
{
struct Student* p;
for (p = stu; p != NULL; p = p->next)
{
printf("%d %s %c %d\n", p->num, p->name, p->sex, p->age);
}
}
}
方法一简化版:(简化input函数)
#include <stdio.h>
#include <stdlib.h>
//声明结构体struct Student
struct Student
{
int num;
char name[20];
char sex;
int age;
struct Student *prev;
struct Student *next;
};
struct Student *input(struct Student *stu, int n);//声明输入函数
void append(struct Student **, struct Student *);//声明建立链表
void del_list(struct Student**, int);//声明删除一个链表中多个节点函数(由age)
struct Student* del_item(struct Student**, struct Student*);//声明删除单个节点函数
void print(struct Student *);//声明输出函数
int main()
{
struct Student *a=(struct Student*)malloc(3*sizeof(struct Student));//相当于struct Student a[3]
struct Student *b=(struct Student*)malloc(2*sizeof(struct Student));//相当于struct Student b[3]
a=input(a, 3); //调用输入函数,输入a链表
int age;
printf("Please enter delete age: ");
scanf("%d", &age);
del_list(&a, age); //从a中删除b
print(a);
free(a);
free(b);
return 0;
}
//输入函数
struct Student *input(struct Student *stu, int n)//先建立两个链表
{
int i=0;
struct Student *p;
for (p=stu; p<stu+n; p++, i++)
{
printf("Please enter No.%d student info; ", i+1);
scanf("%d %s %c %d", &p->num, p->name, &p->sex, &p->age);
i==0?(p->prev=NULL):(p->prev=&stu[i-1]);
i==n-1 ? (p->next=NULL) : (p->next=&stu[i+1]);
}
printf("\n");
return stu;
}
//删除一个链表中多个节点函数(由age)
void del_list(struct Student** head, int age)
{
struct Student* p;
for (p = *head; p != NULL; )
{
if (p->age == age)
p = del_item(head, p);
else
p = p->next;
}
}
//删除单个节点函数
struct Student* del_item(struct Student** head, struct Student* p)
{
if (p == *head)
*head = p->next;
if (p->prev != NULL)
p->prev->next = p->next;
if (p->next != NULL)
p->next->prev = p->prev;
struct Student* next = p->next;
return next;
}
//输出函数
void print(struct Student *stu)
{
if(stu == NULL)
printf("Empty Linked list.\n");
else
{
struct Student *p;
for (p=stu; p!=NULL; p=p->next)
{
printf("%d %s %c %d\n", p->num, p->name, p->sex, p->age);
}
}
}
在VS2019下,需将源文件的scanf做些修改:
#include <stdio.h>
#include <stdlib.h>
//声明结构体struct Student
struct Student
{
int num;
char name[20];
char sex;
int age;
struct Student* prev;
struct Student* next;
};
struct Student* input(struct Student* stu, int n);//声明输入函数
void append(struct Student**, struct Student*);//声明建立链表
void del_list(struct Student**, int);//声明删除一个链表中多个节点函数(由age)
struct Student* del_item(struct Student**, struct Student*);//声明删除单个节点函数
void print(struct Student*);//声明输出函数
int main()
{
struct Student* a = (struct Student*)malloc(3 * sizeof(struct Student));//相当于struct Student a[3]
struct Student* b = (struct Student*)malloc(2 * sizeof(struct Student));//相当于struct Student b[3]
a = input(a, 3); //调用输入函数,输入a链表
int age;
printf("Please enter delete age: ");
scanf_s("%d", &age);
del_list(&a, age); //从a中删除b
print(a);
free(a);
free(b);
return 0;
}
//输入函数
struct Student* input(struct Student* stu, int n)//先建立两个链表
{
int i = 0;
struct Student* p;
for (p = stu; p < stu + n; p++, i++)
{
printf("Please enter No.%d student info; ", i + 1);
scanf_s("%d %s %c %d", &p->num, p->name, (unsigned int)sizeof(p->name), &p->sex, (unsigned int)sizeof(p->sex), &p->age);
i == 0 ? (p->prev = NULL) : (p->prev = &stu[i - 1]);
i == n - 1 ? (p->next = NULL) : (p->next = &stu[i + 1]);
}
printf("\n");
return stu;
}
//删除一个链表中多个节点函数(由age)
void del_list(struct Student** head, int age)
{
struct Student* p;
for (p = *head; p != NULL; )
{
if (p->age == age)
p = del_item(head, p);
else
p = p->next;
}
}
//删除单个节点函数
struct Student* del_item(struct Student** head, struct Student* p)
{
if (p == *head)
*head = p->next;
if (p->prev != NULL)
p->prev->next = p->next;
if (p->next != NULL)
p->next->prev = p->prev;
struct Student* next = p->next;
return next;
}
//输出函数
void print(struct Student* stu)
{
if (stu == NULL)
printf("Empty Linked list.\n");
else
{
struct Student* p;
for (p = stu; p != NULL; p = p->next)
{
printf("%d %s %c %d\n", p->num, p->name, p->sex, p->age);
}
}
}