写一个函数insert,用来向一个动态链表插入节点
用creat,print,del,insert四个函数,编写主函数,先后调用这些函数,实现链表的建立,输出,删除和插入,从主函数中指定需要删除和插入的节点的数据 https://blog.csdn.net/qq_41071068/article/details/90117026
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
struct arr {
int num;
struct arr* next;
};
typedef struct arr arr;
arr* creat(int n) {
arr* s;
arr* p;
arr* head = (arr*)malloc(sizeof(arr));//头结点
p = head;
for (int i = 0; i < n; ++i) {
s = (arr*)malloc(sizeof(arr));
s->num = i + 1;
s->next = p->next;
p->next = s;
p = p->next;
if (i == n - 1) {
p->next = NULL;
}
}
return head;
}
void print(arr* head) {
for (arr* p = head ->next; p != NULL; p = p->next) {
printf("%d\t", p->num);
}
printf("\n");
}
arr* insert(int m, arr* head) {
int n;
arr* p = head;
arr* s = (arr*)malloc(sizeof(arr));
printf("请输入num的值\n");
scanf("%d", &n);
s->num = n;
for (int i = 0; i < m; ++i) {
p = p->next;
}
s->next = p->next;
p->next = s;
return head;
}
void main() {
int n, m;
printf("请输入链表的长度\n");
for (scanf("%d", &n); n <= 0; printf("您输入有误,请重新输入\n"), scanf("%d", &n));
arr* head;
head = creat(n);
printf("输出未插入新节点前链表\n");
print(head);
printf("请输入需要插入的位置(0<= m <=%d)\n", n);
for (scanf("%d", &m); m < 0 || m > n; printf("您输入有误,请重新输入\n"), scanf("%d", &m));
head = insert(m, head);
print(head);
system("pause");
}