单链表 Ultimate Edition

#include <iostream>
using namespace std;
#define OK 1;
#define ERROR 0;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */

typedef int Status;
typedef int ElemType;

typedef struct LNode {//存储结构 
	ElemType data;//数据域 
	struct LNode* next;	//指针域 
}LNode, * LinkList;/*LinkList是指向LNode结构体的指针类型，可以通过这个指针类型定义LNode这个结构体的表 */

Status InitList(LinkList& L);//初始化

void CreateList_H(LinkList& L, int n);//头插法创建单链表
void CreateList_R(LinkList& L, int n);//后插法创建单链表 

void TraverseList(LinkList L);//遍历单链表 
void Connect(LinkList& L, LinkList& Q,LinkList& C);//合并单链表 有删
void Connect2(LinkList& L, LinkList& Q, LinkList& C);//合并单链表 保留
Status GetElem(LinkList L, int i, ElemType& e);//按位查找值 
int LocateElem(LinkList L, ElemType);//按值查找地址 
Status ListInsert(LinkList& L, int i, ElemType e);//单个数据插入 
Status ListDelete(LinkList& L, int i);//删除第i个数据 

int main(int argc, char** argv) {
	LinkList L;
	LinkList Q;
	LinkList C;
	int n, i, choice = 1;
	ElemType e, value;
	InitList(L);
	cout <<"《第三次作业（关于单链表的练习）》"<<endl
		<<"					"<<endl
		<< "输入对应序号使用功能:" << endl
		<< "①.创建链表" << endl
		<< "②.遍历链表" << endl
		<< "③.按位查询" << endl
		<< "④.按值查询" << endl
		<< "⑤.按位插入" << endl
		<< "⑥.按位删除" << endl
		<< "⑦.合并链表(重复有删除)" << endl
		<< "⑧.合并链表(重复无删除)" << endl
		<< "<0>.退出" << endl
		<< "--------------------" << endl;
	while (choice) {
		cout << "请输入你要进行的操作:\t";
		cin >> choice;
		if (choice > 8)cout << "Sorry，your input is wrong！" << endl;
		switch (choice) {

		case 1://后插法创建单链表 
			cout << "你想创建单链表的表长为：";
			cin >> n;
			CreateList_R(L, n);
			break;

		case 2://遍历 
			if (!L->next) {
				cout << "还未创建单链表，查询失败！" << endl;
				break;
			}
			TraverseList(L);
			break;

		case 3://按位查询 
			if (!L->next) {
				cout << "还未创建单链表，查询失败！" << endl;
				break;
			}
			cout << "你想查询的位置i是：";
			cin >> i;
			if (GetElem(L, i, e))
				cout << "它的位置是:" << e << endl;
			else
				cout << "查询失败！" <<endl;
			break;

		case 4://按值查询 
			if (!L->next) {
				cout << "还未创建单链表，查询失败！" << endl;
				break;
			}
			cout << "你想查询的值为：";
			cin >> value;
			if (LocateElem(L, value))

				cout << "它的位置是:" << LocateElem(L, value) << endl;

			else
				cout << "查找不到" << endl;
			break;

		case 5://插入 
			if (!L->next) {
				cout << "还未创建单链表，查询失败！" << endl;
				break;
			}
			cout << "你想插入的位置和数字是：";
			cin >> i >> e;
			if (ListInsert(L, i, e))cout << "插入成功！";
			else cout << "输入位置不合法！";
			break;

		case 6://删除
			if (!L->next) {
				cout << "还未创建单链表，查询失败！" << endl;
				break;
			}
			cout << "你想删除的位置i是：";
			cin >> i;
			if (ListDelete(L, i))
				cout << "删除成功!" << endl;
			else 
				cout << "删除失败，删除位置不合法！";
			break;
		case 7://合并 有删
			
			if (!L->next) {
				cout << "还未创建单链表，查询失败！" << endl;
				break;
			}
			cout << "请输入第二个单链表的表长" << endl;
			cin >> n;
			CreateList_R(Q, n);
			Connect(L,Q,C);
			cout << endl ;
			break;

		case 8://合并 有删

			if (!L->next) {
				cout << "还未创建单链表，查询失败！" << endl;
				break;
			}
			cout << "请输入第二个单链表的表长" << endl;
			cin >> n;
			CreateList_R(Q, n);
			Connect2(L, Q, C);
			cout << endl;
			break;

		case 0:
			cout << "结束！" << endl;
			return 0;
		}
	}
	return 0;
}

Status InitList(LinkList& L) {
	L = new LNode;
	L->next = NULL;
	return 1;
}
Status InitList2(LinkList& Q) {
	Q = new LNode;
	Q->next = NULL;
	return 1;
}

void CreateList_H(LinkList& L, int n) {

	L = new LNode;
	L->next = NULL;
	for (int i = 0; i < n; i++) {
		LinkList p;
		p = new LNode;
		cout << "请输入第" << n - i << "个数为:";
		cin >> p->data;
		p->next = L->next;
		L->next = p;
	}
	cout << "前插法创建成功！" << endl;
}

void CreateList_R(LinkList& L, int n) {
	L = new LNode;
	L->next = NULL;
	LinkList p, r;
	r = L;
	for (int i = 0; i < n; i++) {
		p = new LNode;
		cout << "请输入第" << i + 1 << "个数为:";
		cin >> p->data;
		p->next = NULL;
		r->next = p;
		r = p;
	}
	cout << "创建成功！" << endl;
}



void TraverseList(LinkList L) {
	LinkList p;
	p = L;
	cout << "遍历结果：";
	while (p->next != NULL) {
		p = p->next;
		cout << p->data << "  ";
	}
	cout << endl;

}

Status GetElem(LinkList L, int i, ElemType& e) {
	LinkList p;
	p = L;
	int j;
	for (j = 0; j < i && p; j++)//防止系统停止运行 
		p = p->next;
	if (!p || i < 1)return ERROR;
	e = p->data;
	return OK;
}

int LocateElem(LinkList L, ElemType e) {
	LinkList p = L->next;//初始化指向首元结点
	int i = 1;
	for ( i = 1; p && p->data != e;i++) {
		p = p->next;
		
	}
	return i;//1.p为NULL 2.p->data==e 

}

Status ListInsert(LinkList& L, int i, ElemType e) {
	//带有头结点 在第i个位置插入新结点（计数时不包含头结点）。
	LinkList p, q;
	p = L;
	int j = 0;

	q = new LNode;
	q->next = NULL;
	q->data = e;
	while (p && j < i - 1)//找第i-1个结点 
	{
		p = p->next;
		j++;
	}
	if (!p && i < 1)return ERROR;/*p为空说明未找到第i-1个结点 或者说i-1个结点是n+1 */
	q->next = p->next;//先连接后面
	p->next = q;//再断掉前面
	return OK;
}

Status ListDelete(LinkList& L, int i) {
	//找到第i-1个结点

	LinkList p, q;
	p = L;
	int j = 0;
	while (p->next && j < i - 1)//找第i-1个结点 
	{
		p = p->next;
		j++;
	}
	if (!p->next || i < 1)return ERROR;/*p->next为空则证明第i-1个结点是最后一个结点n 第i个不存在 无法删除 */
	q = p->next;//先把p-q及后面的链条全复制来，保证他们不丢失
	p->next = q->next;//用q过渡一下第i-1个和第i+1个（再直接连到q的next上到下一个元素，空架掉q
	delete q;//将过渡的这个辅助q删除掉 
	return OK;

}
void Connect(LinkList& A,LinkList& B,LinkList& C)
{
	LinkList pa, pb, t;
	pa = A->next;//pa,pb指针来遍历A，B链表，t始终指向C的尾部，采用尾插法建C链表； 
	pb = B->next;
	C = A;
	C->next = NULL;
	//free(B);
	t = C;
	// 尾插法建立链表； 
	while (pa != NULL && pb != NULL) 
	{
		if (pa->data < pb->data) 
		{	
			
				t->next = pa;
				t = t->next;
				pa = pa->next;

		}
		else if (pa->data > pb->data) 
		{
			t->next = pb;
			t = t->next;
			pb = pb->next;
		}
		else
		{
			t->next = pa;
			t = t->next;
			pa = pa->next;
			pb = pb->next;
		}
		
	}
	if (pa == NULL) {
		t->next = pb;
	}
	//B先遍历完 ，链A； 
	if (pb == NULL) {
		t->next = pa;
	}
		
		cout << "合并结果：";
		while (C->next != NULL)
		{
		C = C->next;
		cout << C->data << "  ";
		}
}
void Connect2(LinkList& A, LinkList& B, LinkList& C)
{
	LinkList pa, pb, t;
	pa = A->next;//pa,pb指针来遍历A，B链表，t始终指向C的尾部，采用尾插法建C链表； 
	pb = B->next;
	C = A;
	C->next = NULL;
	//free(B);
	t = C;
	// 尾插法建立链表； 
	while (pa != NULL && pb != NULL)
	{
		if (pa->data <= pb->data)
		{

			t->next = pa;
			t = t->next;
			pa = pa->next;

		}
		else if (pa->data > pb->data)
		{
			t->next = pb;
			t = t->next;
			pb = pb->next;
		}
	

	}
	if (pa == NULL) {
		t->next = pb;
	}
	//B先遍历完 ，链A； 
	if (pb == NULL) {
		t->next = pa;
	}

	cout << "合并结果：";
	while (C->next != NULL)
	{
		C = C->next;
		cout << C->data << "  ";
	}
}