下周就要写链表了,提前写熟悉一下,主要是ADT的大部分函数。本来还写了逆序的函数,但因为过于丑陋以及运行不佳就删了。还有就是链表问题真的挺注重细节,细心点写吧。
#include <bits/stdc++.h>
using namespace std;
typedef struct LNode{
int data;
struct LNode *next;
}LNode,*LinkList;
void createList(LinkList &L,int n) //头插法
{
LNode *r,*p;
L = new LNode;
r = L;
L->next = NULL;
while(n--)
{
p =new LNode;
cin >> p->data;
p->next = NULL;
r->next = p;
r = p;
}
}
void createList1(LinkList &L,int n) //尾插法
{
LNode *p;
L = new LNode;
L->next = NULL;
while( n--)
{
p = new LNode;
cin >> p->data;
p->next = L->next;
L->next = p;
}
}
void print(LinkList L) //输出链表
{
LNode *p = L->next;
while(p)
{
cout << p->data << endl;
p = p->next;
}
}
int getelem(LinkList L,int i,int &e) //获取元素
{
LNode *p;
int j = 1;
p = L->next;
while(p && j < i)
{
p = p->next;
j++;
}
if(!p || j > i) return -1;
e = p->data;
return e;
}
int insertList(LinkList &L,int i,int e) //链表插入
{
LNode *p,*q;
int j = 0;
p = L;
while(p && j < i-1)
{
p = p->next;
j++;
}
if(j > i-1 || !p) return -1;
q = new LNode;
q->data = e;
q->next = p->next;
p->next = q;
return 1;
}
int eraseList(LinkList &L,int i,int &e) //链表删除
{
LNode *p,*q;
int j = 0;
p = L;
while(p->next && j < i-1)
{
{
p = p->next;
j++;
}
}
if(!(p->next) || j > i-1) return -1;
q = p->next;
e = q->data;
p->next = q->next;
delete q;
return e;
}
int merge_List(LinkList &a,LinkList &b , LinkList &c) //合并两个非递减链表
{
LNode *pa,*pb,*pc;
pa = a->next;
pb = b->next;
pc = c = a; //a的头结点给c pc则是一个移动指针
while(pa && pb)
{
if(pa->data > pb->data)
{
pc->next = pb;
pc = pb;
pb = pb->next;
}
else
{
pc->next = pa;
pc = pa;
pa = pa->next;
}
}
if(pa) pc->next = pa;
else pc->next = pb;
}
void clearList(LinkList &L)
{
L->next = NULL;
}
int ListEmpty(LinkList L)
{
LNode *p;
p = L;
if(p->next == NULL)
return 1;
else
return 0;
}
int ListLength(LinkList L)
{
int j = 0;
LNode *p;
p = L;
while(p)
{
p = p->next;
j++;
}
return j-1;
}
int LocateElem(LinkList L ,int e)
{
LNode *p;
int j = 1;
p = L->next;
while(p)
{
if(p->data == e)
return j;
p = p->next;
j++;
}
return -1;
}
int PriorElem(LinkList L,int cur)
{
LNode *p;
p = L->next;
while(p->next)
{
if(p->next->data == cur)
return p->data;
p = p->next;
}
return -1;
}
int NextElem(LinkList L,int cur)
{
LNode *p;
p = L->next;
while(p->next)
{
if(p->data == cur)
return p->next->data;
p = p->next;
}
return -1;
}
int Link_List(LinkList &a,LinkList &b) //将两个非空链表连起来
{
LNode *pa;
pa = a;
while(pa->next)
{
pa = pa->next;
}
pa->next = b->next;
}
int main()
{
int n,i,e,N,A,pos,B,c;
LinkList L,L1,L2,L3;
cout << "选择1创建一个链表。(头插法)"<< endl;
cout << "选择2创建一个链表。(尾插法)"<< endl;
cout << "选择3输出一个链表。" << endl;
cout << "选择4获取链表中的一个元素." << endl;
cout << "选择5向链表中插入一个元素。" <<endl;
cout << "选择6从链表中删除一个元素。" << endl;
cout << "选择7检查链表是否为空。" << endl;
cout << "选择8输出链表的长度。" << endl;
cout << "选择9清空链表。" << endl;
cout << "选择10合并两个非递减的链表。" << endl;
cout << "选择11获取某一个元素的位置。" << endl;
cout << "选择12获取某一个元素在链表中的前驱。" << endl;
cout << "选择13获取某一个元素在链表中的后继。" << endl;
cout << "选择14将两个非空链表连起来。" << endl;
cout << "请输入你的操作次数:" << endl;
cin >> N;
while(N--)
{
cout << "请输入你的选择:" << endl;
cin >> A;
switch(A)
{
case 1:
{
cout << "请输入你想要建立的单链表的长度:" << endl;
cin >> n;
cout << "正在创建单链表。。。。(头插法)" << endl;
createList(L,n);
cout << "单链表创建完毕。" << endl;
break;
}
case 2:
{
cout << "请输入你想要建立的单链表的长度:" << endl;
cin >> n;
cout << "正在创建单链表。。。。(尾插法)" << endl;
createList1(L,n);
cout << "单链表创建完毕。" << endl;
break;
}
case 3:
{
cout << "链表的输出情况为:" << endl;
print(L);
break;
}
case 4:
{
cout << "请输入你所要获取的元素的位置:" << endl;
cin >> i;
int e = getelem(L,i,e);
if(e == -1)
cout << "您访问的元素位置不对" << endl;
else
{
cout << "该元素为:" << endl;
cout << e <<endl;
}
break;
}
case 5:
{
cout << "请输入你所要插入的元素的大小以及位置:" << endl;
cin >> i >> pos;
int c = insertList(L,pos,i);
if(c == -1)
cout << "你输入的位置不对." << endl;
else
cout << "已经插入完毕。" << endl;
break;
}
case 6:
{
cout << "请输入你所要删除元素的位置:" << endl;
cin >> pos;
e = eraseList(L,pos,e);
if(e == -1)
cout << "你输入的位置不太对。" << endl;
else
cout << "已经成功删除." << endl;
break;
}
case 7:
{
cout << "正在检查链表是否为空:(1则为空,否则为0)" << endl;
cout << ListEmpty(L) << endl;
break;
}
case 8:
{
cout << "链表的长度为:" << endl;
cout << ListLength(L) << endl;
break;
}
case 9:
{
cout << "正在清空链表。。。" << endl;
clearList(L);
cout << "链表清空完毕" << endl;
break;
}
case 10:
{
cout << "本过程为合并两个非递减的链表。" << endl;
cout << "请先输入两个链表的长度" << endl;
cin >> A >> B;
cout << "请分别输入两个链表的每个元素:" <<endl;
createList(L1,A);
createList(L2,B);
cout << "正在进行合并,不要着急。。。" << endl;
merge_List(L1,L2,L3);
cout << "已经成功合并两个链表。你太强了。" << endl;
cout << "正在输入最终的链表..." << endl;
print(L3);
break;
}
case 11:
{
cout << "请输入你要获取下标的元素大小:" << endl;
cin >> pos;
e = LocateElem(L,pos);
if(e == -1)
cout << "没有该元素。" <<endl;
else
cout << e << endl;
break;
}
case 12:
{
cout << "请输入你的要查找前驱的元素的大小:" << endl;
cin >> e;
int c = PriorElem(L,e);
if(c == -1)
cout << "不存在" << endl;
else
cout << c << endl;
break;
}
case 13:
{
cout << "请输入你的要查找后继的元素的大小:" << endl;
cin >> e;
int c = NextElem(L,e);
if(c == -1)
cout << "不存在" << endl;
else
cout << c << endl;
break;
}
case 14:
{
cout << "请依次输入两个链表的长度:" << endl;
cin >> A >> B;
cout << "请分别输入两个链表的每个元素." << endl;
createList(L1,A);
createList(L2,B);
cout << "正在连接两个链表。" << endl;
Link_List(L1,L2);
cout << "正在输出最终的链表。" << endl;
print(L1);
break;
}
}
}
}