#include <stdio.h>
#include <stdlib.h>
typedef int ElemType;
typedef struct Node {
ElemType data; //单链表中的数据域
struct Node *next; //单链表的指针域
}Node,*LinkedList;
//单链表的初始化
LinkedList InitLinkData()
{
Node *L;
L = (Node *)malloc(sizeof(Node)); //申请头结点空间
L->next = NULL; //初始化一个空链表
Node *r;
r = L; //r始终指向终端结点,开始时指向头结点
ElemType x; //x为链表数据域中的数据
while(scanf("%d",&x) != EOF)
{
Node *p;
p = (Node *)malloc(sizeof(Node)); //申请新的结点
p->data = x; //结点数据域赋值
r->next = p; //将结点插入到表头L-->|1|-->|2|-->NULL
r = p;
}
r->next = NULL;
return L;
}
//单链表的插入,在链表的第i个位置插入x的元素
LinkedList InsertData(LinkedList L,int i,ElemType x)
{
Node *pre; //pre为前驱结点
pre = L;
int tempi = 0;
for (tempi = 1; tempi < i; tempi++)
{
pre = pre->next; //查找第i个位置的前驱结点
}
Node *p; //插入的结点为p
p = (Node *)malloc(sizeof(Node));
p->data = x;
p->next = pre->next;
pre->next = p;
return L;
}
//单链表的删除,在链表中删除值为x的元素
LinkedList DeleteData(LinkedList L,ElemType x)
{
Node *p,*pre; //pre为前驱结点,p为查找的结点。
p = L->next;
while(p->data != x) { //查找值为x的元素
pre = p;
p = p->next;
}
pre->next = p->next; //删除操作,将其前驱next指向其后继。
free(p);
return L;
}
//单链表的修改,在链表的第i个位置插入x的元素,在链表中删除值为y的元素 //
LinkedList ModifyData(LinkedList L,int i,ElemType x,ElemType y)
{
Node *pre; //pre为前驱结点
pre = L;
int tempi = 0;
for (tempi = 1; tempi < i; tempi++)
{
pre = pre->next; //查找第i个位置的前驱结点
}
Node *p; //插入的结点为p
p = (Node *)malloc(sizeof(Node));
p->data = x;
p->next = pre->next;
pre->next = p;
// Node *p,*pre; //pre为前驱结点,p为查找的结点。
p = L->next;
while(p->data != y) { //查找值为y的元素
pre = p;
p = p->next;
}
pre->next = p->next; //删除操作,将其前驱next指向其后继。
free(p);
return L;
}
int main(int argc, char *argv[])
{
LinkedList list,start;
//1
printf("Please input Init data: -10 0 5 -5 10(End by ctrl+d)\n");
list = InitLinkData();
for(start = list->next; start != NULL; start = start->next)
{
printf("%d ",start->data);
}
printf("\n");
//2
InsertData(list,3,2019);
for(start = list->next; start != NULL; start = start->next)
{
printf("%d ",start->data);
}
printf("\n");
//3
DeleteData(list,5);
for(start = list->next; start != NULL; start = start->next)
{
printf("%d ",start->data);
}
printf("\n");
//4
//todo
ModifyData(list,4,2020,-5);
for(start = list->next; start != NULL; start = start->next)
{
printf("%d ",start->data);
}
printf("\n");
return 0;
}