输入3 4 5 6 7 9999一串整数,9999代表结束,通过尾插法新建链表,查找第二个位置的值并输出,在2个位置插入99,输出为 3 99 4 5 6 7,删除第4个位置的值,打印输出为 3 99 4 5 6 7。
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#define Maxsize 50
typedef struct LNode {
int data;
struct LNode* next;
}LNode, * LinkList;
LinkList crateList(LinkList& L)
{
L = (LinkList)malloc(sizeof(struct LNode));
LinkList s, r = L;
int x;
scanf("%d", &x);
while (9999!=x)
{
s = (LinkList)malloc(sizeof(struct LNode));
s->data = x;
s->next = r->next;
r->next = s;
r = s;
scanf("%d", &x);
}
r->next = NULL;
return L;
}
LinkList SearchElem(LinkList L,int i)
{
LinkList p;
p = L->next;
int j = 1;
if (i==0)
{
return L;
}
if (i<1)
{
return NULL;
}
while(p && j<i)
{
p = p->next;
j++;
}
return p;
}
bool insertList(LinkList& L,int i,int m)
{
LinkList p,s;
p = SearchElem(L, i-1);
s= (LinkList)malloc(sizeof(struct LNode));
s->data = m;
s->next = p->next;
p->next = s;
return true;
}
bool deList(LinkList& L, int i)
{
LinkList p,q;
p = SearchElem(L, i-1);
q= SearchElem(L, i);
q = p->next;
p->next = q->next;
free(q);
return true;
}
void PrintList(LinkList L)
{
L = L->next;
while (L != NULL)
{
printf("%3d", L->data);
L = L->next;
}
printf("\n");
}
int main()
{
LinkList L;
crateList(L);
SearchElem(L, 2);
printf("%d", SearchElem(L, 2)->data);
printf("\n");
insertList(L, 2, 99);
PrintList(L);
deList(L, 4);
PrintList(L);
return 0;
}