学习笔记1:对链表结点的删除
题目:写一函数,删除动态链表中指定的结点
思路:
#include <stdio.h>
#include<malloc.h>
#include <stdlib.h> //因为下面用到NULL,所以在此引入
#define LEN sizeof(struct student) //student结构的大小
struct student *creat(); //创建链表
struct student *del(struct student *head, int num); //del函数用于删除结点,*head即链表的头指针,num是要删除的结点
void print(struct student *head); //打印链表函数
struct student
{
int num;
float score;
struct student *next;
};
int n; //全局变量,用来记录存放了多少数据
void main()
{
struct student *stu, *p;
int n;
stu = creat();
p = stu;
print(p);
printf("Please enter the num to delete:");
scanf("%d", &n);
print(del(p, n));
printf("\n\n");
system("pause");
}
struct student *creat()
{
struct student *head;
struct student *p1, *p2;
p1 = p2 = (struct student *)malloc(LEN); //LEN是student结构的大小
printf("Please enter the num :");
scanf("%d", &p1->num);
printf("Please enter the score :");
scanf("%f", &p1->score);
head = NULL;
n = 0;