#include<iostream>
using namespace std;
typedef int ElementType;//定义类型
typedef struct LNode{ //结点类型
ElementType data; //结点的数据域
struct LNode * next;//指针域
}LNode,*LinkList; //LinkList 为指向结构体LNode的指针类型;
//和之前学的不同点: 增加头结点
//1、初始化
bool InitList(LinkList & L) {//头指针
L = new LNode;
L->next = NULL;
return true;
}
//2.1创建链表 前插法:逆序输出,头结点后增加
bool CreateList1(LinkList & L) {
int a = 0, b = 0;
L = new LNode;
L->next = NULL;
cout << "please input the length of the list:" << endl;
cin >> a;
if (a <= 0) return false;
LinkList p;
while (a--) {
p= new LNode;
cout << "input the number" << endl;
cin >> b;
p->data = b;
p ->next= L->next;//插入L头结点后面
L->next = p;
}
L->next = NULL;
return true;
}
//3 后插法
bool CreateList2(LinkList & L) {
int a = 0, b = 0;
L = new LNode;
L->next = NULL;
cout << "please input the length of the list:" << endl;
cin >> a;
LinkList p,r;
r = L;//尾结点指向头结点
while (a--) {
p = new LNode;
cout << "input the number" << endl;
cin >> b;
p->data = b;
p->next = NULL;
r->next=p;//插入L尾指针后面
r=p;
}
return true;
}
//4.取值,复杂度o((n-1)/2) 1《i《n,移动步数(i-1)
bool GetElem(LinkList L, int i, ElementType & e) {
LinkList p = new LNode;
p = L->next;
int j = 1;
while (p&& j < i) {
p = p->next;
++j;//次数增加
}
if (!p&&j > i) return false;
e = p->data;
return true;
}
//5.查找 复杂度同上,按值查找
LNode * LocateElem(LinkList L, ElementType e) {
LinkList p = new LNode;
p = L->next;//初始指向首元结点
while (p && p->data != e) {//向后扫描,直到p为空或p值等于e
p = p->next;
}
return p;
}
//6.插入 复杂度o(n) 复杂度o((n)/2) 1《i《n,移动步数(i-1)
bool ListInsert(LinkList & L, int i,ElementType e) {
//在带头结点的单链表L中第i个位置插入值为e
LinkList p,s;
p = new LNode;
p = L;
int j = 0;//计算步数
while (p && (j < i - 1)) {//加到插入位前一位
p = p->next;
++j;
}
if (!p || j > i - 1)
return false;
s = new LNode;
s->data = e;
s->next = p->next;
p->next = s;
return true;
}
//7.删除 第几个结点o((n-1)/2)
bool ListDelete(LinkList &L, int i)
{
LinkList p,q;
p = new LNode;
p = L;//头结点
int j = 0;
while ((p->next) && (j < i - 1)) {
p = p->next; ++j;
}
if (!(p->next) || (j > i - 1))
return false;
q = new LNode;
q = p->next;
p->next = q->next;
delete q;
q = NULL;
return true;
}
//8.输出列表
void TraverseList(LinkList L) {
LinkList p;
p = new LNode;
p = L->next;//头结点
if (!p)
cout << " NULL " << endl;
while (p) {
cout << p->data << " ";
p = p->next;
}
}
//9.销毁 毁掉头
void DestroyList(LinkList &L) {
if (!L) {
cout << "List NULL" << endl;
}
else {
LinkList p = new LNode;
LinkList q = new LNode;
p = L;//头结点
while (p!=NULL) {
q = p->next;
delete p;
p = q;
}
cout << "destroy OK" << endl;
}
}
//10.清空 只留下头
void ClearList(LinkList &L) {
if (!L) {
cout << "List NULL" << endl;
}
else {
LinkList p, q;
p = new LNode;
p = L->next;
while(p!=NULL){
q = p->next;
delete p;
p = q;
}
L->next = NULL;
cout << "clear OK" << endl;
}
}
//11.有序表的合并,有重复的
bool MergeList1(LinkList & L1, LinkList & L2,LinkList & L3) {//小到大排序
LinkList pc, pa, pb;
pa = L1->next;
pb = L2->next;
L3 = pc=L1;
while (pa&&pb) {
if (pa->data <= pb->data) {
pc->next = pa;
pc = pa;
pa = pa->next;
}
else {
pc->next = pb;
pc = pb;
pb = pb->next;
}
}
pc->next = pa? pa : pb;
delete L2; //释放Lb的头结点
L2 = NULL;
return true;
}
//12.合并2个同时为递增或递减的序列,没有重复
bool MergeList(LinkList &La, LinkList &Lb, LinkList &Lc) {
LinkList pa, pb, pc,temp;
pa = La->next;
pb = Lb->next;
Lc = pc = La;
while (pa && pb) {
if (pa->data < pb->data) {
pc->next = pa; pc = pa; pa = pa->next;
}
else if (pa->data > pb->data) {
pc->next = pb; pc = pb; pb = pb->next;
}
else {
pc->next = pa;
pc = pa;
pa = pa->next;
temp = pb->next;
delete pb;
pb = temp;
}
}
pc->next = pa ? pa : pb;
delete Lb;
return true;
}
//13.逆置且不开辟新空间,只能改变指针指向,且用前插法简单
void Inverse(LinkList &L) {
LinkList p, q;
p = L->next;
L->next = NULL;
while (p != NULL) {
q = p->next;
p->next = L->next;
L->next = p;
p = q;
}
}
//14.递增序列删除闭区间值结点
void DeleteMinMax(LinkList &L, int mink, int maxk) {
LinkList p=L->next,pre=NULL,q=NULL,s=NULL;
while (p&&p->data < mink) {
pre = p;
p= p->next;
}
while (p&&p->data <= maxk) {
p = p->next;
}
q = pre->next;
pre->next = p;
while (q != p) {
s = q->next;
delete q;
q = s;
}
}
//15.差异 在A中减少B的元素,A,B都是单调递增
void Difference(LinkList &L1, LinkList&L2,int & n) {
LinkList pa, pb, pre,temp;
pa = L1->next; pb = L2->next;
pre = pa; n = 0;
while (pa&&pb) {
if (pa->data < pb->data) {
pre = pa; pa = pa->next;
n++;
}
else if (pa->data > pb->data) {
pb = pb->next;
}
else {
pre->next = pa->next;
temp = pa;
pa = pa->next;
delete temp;
}
}
}
//16.交集
bool Intersection(LinkList &La, LinkList &Lb, LinkList &Lc) {
LinkList pa, pb, pc, temp;
pa = La->next;
pb = Lb->next;
Lc = pc = La;
while (pa && pb) {//删除较小者的元素
if (pa->data < pb->data) {
temp = pa; pa = pa->next; delete temp;
}
else if (pa->data > pb->data) {
temp = pb; pb = pb->next; delete temp;
}
else {
pc->next = pa; pc = pa; pa = pa->next;
temp = pb; pb = pb->next; delete temp;
}
}
while (pa) {
temp = pa; pa = pa->next; delete temp;
}
while(pb) {
temp = pb; pb = pb->next; delete temp;
}
pc->next = NULL;
delete Lb;
return true;
}
int main() {
LinkList mylist=new LNode;
int i, e, x;
cout << "1.初始化\n";
cout << "创建方法只能选择一个:\n";
cout << "2.创建(前插法)\n";
cout << "3.创建(后插法)\n";
cout << "4.取值" << endl;
cout << "5.查找\n";
cout << "6.插入\n";
cout << "7.删除\n";
cout << "8.输出\n";
cout << " 9.销毁\n";
cout << " 10.清零\n";
cout << " 11.单序合并(无重复)\n ";
cout << "12.单序合并(有重复)\n";
cout << "13.逆置\n";
cout << "14.删除闭区间内数据\n";
cout<< "15.差异\n";
cout << "16.交集\n";
cout << "0.退出\n";
int choice = -1;
while (choice != 0) {
cout << "\nchoice=" << endl;
cin>> choice;
switch (choice) {
case 1: //初始化
if (InitList(mylist))
cout << "顺序表初始化成功" << endl;
else cout << "顺序表初始化不成功" << endl;
break;
case 2://前入创建
if (CreateList1(mylist)) {
cout << "顺序表创建成功" << endl;
break;
}
else
cout << "顺序表创建不成功" << endl;
break;
case 3://后入创建
if (CreateList2(mylist)) {
cout << "顺序表创建成功" << endl;
break;
}
else
cout << "顺序表创建不成功" << endl;
break;
case 4://取值
cout << "输入第i(整数)个元素" << endl;
cin >> i;
if (GetElem(mylist, i, e) == 1) {
cout << "第" << i << "个元素是" << e << endl;
}
else if (GetElem(mylist, i, e) == 0)
cout << "顺序表取值失败,overflow" << endl;
break;
case 5://查找
cout << "查找的数字:" << endl;
cin >> x;
if (LocateElem(mylist, x) == NULL) {
cout << "查无此数字" << endl;
}
else
cout << "查找成功,要找的数字结点的位置是" << LocateElem(mylist, x) << endl;
break;
case 6://插入
cout << "要插入的位置和值分别是:" << endl; cin >> i >> e;
if (ListInsert(mylist, i, e)) {
cout << "插入成功" << endl;
}
else cout << "插入失败" << endl;
break;
case 7://删除
cout << "要删除的位置分别是:" << endl; cin >> i;
if (ListDelete(mylist, i)) {
cout << "删除成功" << endl;
}
else cout << "删除失败" << endl;
break;
case 8://输出
TraverseList(mylist);
break;
case 9://销毁
DestroyList(mylist);
break;
case 10://清零
ClearList(mylist);
break;
case 11:
LinkList mylist2, mylist3;
if (InitList(mylist2))
cout << "顺序表mylist2初始化成功" << endl;
else {
cout << "顺序表mylist2初始化不成功" << endl;
break;
}
if (CreateList2(mylist2)) {
cout << "顺序表mylist2创建成功" << endl;
}
else {
cout << "顺序表创建不成功" << endl;
break;
}
if (InitList(mylist3))
cout << "顺序表初始化成功" << endl;
else {
cout << "顺序表初始化不成功" << endl;
break;
}
cout << "mylist1=";
TraverseList(mylist);
cout << "\nmylist2=";
TraverseList(mylist2);
MergeList(mylist, mylist2, mylist3);
cout << "\nmylist3=";
TraverseList(mylist3);
break;
case 12:
if (InitList(mylist2))
cout << "顺序表mylist2初始化成功" << endl;
else {
cout << "顺序表mylist2初始化不成功" << endl;
break;
}
if (CreateList2(mylist2)) {
cout << "顺序表mylist2创建成功" << endl;
}
else {
cout << "顺序表创建不成功" << endl;
break;
}
if (InitList(mylist3))
cout << "顺序表初始化成功" << endl;
else {
cout << "顺序表初始化不成功" << endl;
break;
}
cout << "mylist1=";
TraverseList(mylist);
cout << "\nmylist2=";
TraverseList(mylist2);
MergeList1(mylist, mylist2, mylist3);
cout << "\nmylist3=";
TraverseList(mylist3);
break;
case 13: Inverse(mylist);
break;
case 14: {
int x, y;
cout << "the min,max of border " << endl;
cin >> x >> y;
DeleteMinMax(mylist, x, y);
cout << "mylist1=";
TraverseList(mylist);
break;
}
case 15:
if (InitList(mylist2))
cout << "顺序表mylist2初始化成功" << endl;
else {
cout << "顺序表mylist2初始化不成功" << endl;
break;
}
if (CreateList2(mylist2)) {
cout << "顺序表mylist2创建成功" << endl;
}
else {
cout << "顺序表创建不成功" << endl;
break;
}
if (InitList(mylist3))
cout << "顺序表初始化成功" << endl;
else {
cout << "顺序表初始化不成功" << endl;
break;
}
cout << "mylist1=";
TraverseList(mylist);
cout << "\nmylist2=";
TraverseList(mylist2);
int n;
Difference(mylist, mylist2,n);
cout << "\nmylist3=";
TraverseList(mylist);
break;
case 16:
if (InitList(mylist2))
cout << "顺序表mylist2初始化成功" << endl;
else {
cout << "顺序表mylist2初始化不成功" << endl;
break;
}
if (CreateList2(mylist2)) {
cout << "顺序表mylist2创建成功" << endl;
}
else {
cout << "顺序表创建不成功" << endl;
break;
}
if (InitList(mylist3))
cout << "顺序表初始化成功" << endl;
else {
cout << "顺序表初始化不成功" << endl;
break;
}
cout << "mylist1=";
TraverseList(mylist);
cout << "\nmylist2=";
TraverseList(mylist2);
Intersection(mylist, mylist2, mylist3);
cout << "\nmylist3=";
TraverseList(mylist3);
break;
}
}
}