链表是一种重要的常见的、动态地进行存储分配数据结构,可以根据需要开辟内存单元。链表有一个“头指针”变量,以head表示,它存放一个地址,该地址指向一个元素。链表中每一个元素称为“结点”,每个结点都应包括两个部分:一为用户需要用的实际数据,二为下一个结点的地址。因此,head指向第一个元素:第一个元素又指向第二个元素;……,直到最后一个元素,该元素不再指向其它元素,它称为“表尾”,它的地址部分放一个“NULL”(表示“空地址”),链表到此结束。
声明链表结构体
typedef struct Student {
int num;
struct Student *next;
}student;
创建链表
// 创建链表
struct Student * createLinkList() {
student *head, *p1, *p2 ; // 头节点, p1保存创建的新节点的地址, p2保存原链表最后一个节点的地址
int n = 1;
head = (student *) malloc(sizeof(student)); // 开辟一个新节点
if (head == NULL) {
printf("开辟新节点内存失败\n");
return NULL;
}
head -> num = n;
head -> next = NULL;
p2 = p1 = head; // 如果节点开辟成功,则p2先把它的指针保存下来以备后用
while (n <= 10) {
n += 1;
p1 = (student *) malloc(sizeof(student)); //请求链表内存大小
p1 -> num = n;
p1 -> next = NULL;
p2 -> next = p1;
p2 = p1;
}
// free(p1);
// p1 = NULL;
return head;
}
打印链表
void printLinkList(student *head) {
if (head == NULL) return;
student *node = head;
while(node) {
printf("%d ", node -> num);
node = node -> next;
}
printf("\n");
}
删除指定节点
student *deleteLinkList(student *head, int num) {
student *p1, *p2;
if (head == NULL) {
printf("链表为空\n");
return head;
}
// 先定位要删除的节点
p1 = head;
// p1指针所指向的不是要找的,且不是尾节点
while (p1 -> num != num && p1 -> next != NULL) {
p2 = p1;
p1 = p1 -> next;
}
if (p1 -> num == num) {
if (p1 == head) {
head = p1 -> next;
} else {
p2 -> next = p1 -> next;
}
free(p1);
p1 = NULL;
} else {
printf("待删除数%d没有被发现!\n", num);
}
return head;
}
插入链表
// 插入链表,
student *insertLinkList(student *head, int num, int value) {
if (head == NULL) {
student *node = (student *)malloc(sizeof(student));
node -> num = value;
head = node;
head -> next = NULL;
return head;
}
student *p1 = head;
while(p1 -> num != num && p1 -> next != NULL) {
p1 = p1 -> next;
}
if (p1 -> num == num) {
student *node = (student *)malloc(sizeof(student));
node -> num = value;
node -> next = p1 -> next;
p1 -> next = node;
} else {
printf("未找到指定节点\n");
}
return head;
}
链表反序
// 链表反序
student *reverseLinkList(student *head) {
if (head == NULL) return head;
student *p1, *p2;
p1 = NULL;
p2 = head;
while(p2) {
student *tmp = p2 -> next;
p2 -> next = p1;
p1 = p2;
p2 = tmp;
}
return p1;
}
Main函数中调用:
int main(int argc, char *argv[]){
student *head = createLinkList();
if (head) {
printLinkList(head);
student *delHead = deleteLinkList(head, 5);
printLinkList(delHead);
student *insertHead = insertLinkList(head, 3, 20);
printLinkList(insertHead);
student *reverseHead = reverseLinkList(head);
printLinkList(reverseHead);
free(delHead);
free(insertHead);
free(reverseHead);
}
free(head);
head = NULL;
return 0;
}
运行结果:
1 2 3 4 5 6 7 8 9 10 11
1 2 3 4 6 7 8 9 10 11
1 2 3 20 4 6 7 8 9 10 11
11 10 9 8 7 6 4 20 3 2 1