//单链表的创建,删除,插入,遍历;
#include<iostream>using namespace std;
typedef struct Node
{
int data;
Node* next;
}LNode, *LinkList;
//创建单链表
LinkList CreateFromHead(Node* L)
{
int c = 1;
LinkList T;
LNode *p;
L->next = NULL;
T = L;
while (c != 0)
{
cin >> c;
p = new LNode;
p->data = c;
T->next=p;
T = p;
}
T->next = NULL;
return L;
}
LinkList OutputList(Node* L)
{
while (L->next != NULL)
{
L = L->next;
cout << L->data << " ";
}
return L;
}
LinkList InsertToList(Node* L)
{
int InsNum;//需要插入的元素
int BeInsNum;//插入的位置
LinkList Temp;
Temp = new Node;
cout << "请输入要插入的元素: ";
cin >> InsNum;
OutputList(&(*L));
cout <<endl<< "请指出插入到哪个元素后面: ";
cin >> BeInsNum;
while (L->next != NULL)
{
if (BeInsNum == L->data)
{
Temp->next = L->next;
L->next = Temp;
Temp->data = InsNum;
break;
}
else
{
cout << "没找到该元素" << endl;
L = L->next;
}
}
return L;
}
//单链表元素删除
LinkList DeleteNumList(Node* L)
{
int DeleteNum;
LinkList Temp;
Temp = new Node;
cout <<endl <<"要删除哪一个元素: ";
cin >> DeleteNum;
while (L->next != NULL)
{
if (DeleteNum == L->data)
{
L->data= L->next->data;
L->next = L->next->next;//把L指向下一个元素的地址赋给当前;
}
else
L = L->next;
}
return L;
}
int main()
{
LinkList L;
L = new Node;
L->next = NULL;
CreateFromHead(&(*L));
OutputList(&(*L));
InsertToList(&(*L));
DeleteNumList(&(*L));
OutputList(&(*L));
return 0;
}