链表、线性表的初始化和操作。

链表、线性表的初始化和操作。（主要参考自数据结构c语言版）

/*2018.7.24，程序主要参考自数据结构c语言版，主要为了自己练手*/
#include<iostream>
#include<cstdlib>
#include<stdio.h>
using namespace std;
#define OVERFLOW 0

#define LIST_INIT_SIZE 100
#define LISTNCREMENT 10
typedef int Status;
typedef struct LNode{
	int data;
	struct LNode *next;
}LNode,*LinkList;

typedef struct
{
	int *elem;                     //储存空间基址
	int length;                    //当前长度
	int listsize;                  //当前分配的储存容量
}SqList;
/*===================1、线性表部分===================*/
//初始化线性表
Status InitList_Sq(SqList &L)
{
	L.elem = (int *)malloc(LIST_INIT_SIZE*sizeof(int));//malloc返回分配空间首地址
	if (!L.elem) exit(OVERFLOW);
	L.length = 0;
	L.listsize = LIST_INIT_SIZE;
	return 1;
}
//在第i个元素前插入元素e
Status ListInsert_Sq(SqList &L, int i, int e)
{
	if (i<0 || i>L.length + 1) return 0;
	if (L.length >= L.listsize)
	{
		int *newbase = (int*)(malloc(LISTNCREMENT*sizeof(int)));
		if (!newbase) return 0;
		L.elem = newbase;
		L.elem = newbase;
		L.listsize += LISTNCREMENT;
	}
	int* q = &(L.elem[i - 1]);//q为L的第i个值的位置
	for (int* p = &(L.elem[L.length - 1]); p >= q; p--)
		*(p + 1) = *p;
	*q = e;
	++L.length;
	return 1;
}
//删除元素
Status LintDelet_Sq(SqList &L, int i)
{
	if (i<1 || i>L.length) return 0;
	int *p = &(L.elem[i - 1]);
	for (++p; p < &(L.elem[L.length - 1]); p++)  *p = *(p + 1);
	--L.length;
	return 1;
}
//顺序表的合并
Status MergeList_Sq(SqList La, SqList Lb, SqList &Lc)
{
	Lc.listsize = Lc.length = La.length + Lb.length;
	int* Pc = Lc.elem = (int *)malloc(Lc.listsize*sizeof(int));
	if (!Lc.elem)  exit(OVERFLOW);
	int* Pa = La.elem;
	int* Pb = Lb.elem;
	while (Pa < &(La.elem[La.length]) && Pb < &(Lb.elem[Lb.length]))
	{
		if (*Pa >= *Pb)  *Pc++ = *Pb++;
		else *Pc++ = *Pa++;
	}
	while (Pa < &(La.elem[La.length]))    *Pc++ = *Pa++;
	while (Pb < &(Lb.elem[Lb.length]))    *Pc++ = *Pb++;
	return 1;
}
//打印线性表
void PrintList(SqList L){
	for (int i = 0; i < L.length; i++) 
	{
		cout << *(L.elem + i) << "\t"  ;
	}
	cout << endl;

}	

/*===================2、单链表部分===================*/
//创建单链表
LinkList CreateList(LinkList &L, int n)
{
	LinkList temp;
	L = temp = (LinkList)malloc(sizeof(LNode));
	//L->next = NULL;
	for (int i = 0; i <n ; i++)
	{
		LinkList p = (LinkList)malloc(sizeof(LNode));
		cin >> p->data;
		//p->next = NULL;
		temp->next = p;
		temp = p;
	}
	temp->next = NULL;
	return L->next;
}
//查找元素
Status GetElem_L(LinkList L, int i, int &e)
{
	LinkList p = L->next;
	int j = 1;
	if (p&&j++ < i)
	{
		p = p->next;
	}
	j--;
	if (!p||j>i) return 0;
	e = p->data;
	return 1;
}
//插入元素
Status ListInsert_L(LinkList &L, int i, int e)
{
	LinkList p = L;
	int j = 0;
	while (p&&j < i - 1){ p = p->next; j++; }
	if (!p || j>i - 1)  return 0;
	LinkList s = (LinkList)malloc(sizeof(LNode));
	s->data = e;
	s->next = p->next;
	p->next = s;
	return 1;
}
//删除元素
Status ListDelete_L(LinkList &L, int i, int &e)
{
	LinkList p = L;
	int j = 0;
	while (p&&j < i - 1){ p = p->next; j++; }
	if (!p&&j>i - 1) return 0;
	LinkList q = p->next;
	p->next = q->next;
	e = q->data;
	free(q);
	return 1;
}
//链表连接
Status MergeList_L(LinkList &La, LinkList &Lb, LinkList &Lc)
{
	Lc = (LinkList)malloc(sizeof(LNode));
	LinkList Pa = La->next;
	LinkList Pb = Lb->next;
	LinkList Pc = Pa;
	Lc = Pc;
	while (Pa&&Pb)
	{
		//Pc=(LinkList)malloc(sizeof(LNode));
		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;
	//if(Pc == Pa)   Pc->next = Pb;
	//else Pc->next=Pa;
	free(Lb);
	return 1;
}
//打印链表
void PrintLinkList(LinkList L){
	LinkList p = L->next;
	while (p)
	{
		cout << p->data << "\t";
		p = p->next;
	}
	cout << endl;

}
/*===================主函数部分===================*/
int main()
{
	cout << "= == == == == == 线性表操作 == == == == == " << endl;;
	SqList head, list, comb;
	InitList_Sq(head);
	InitList_Sq(list);
	InitList_Sq(comb);
	for (int j = 1; j < 6; j++)
	{
		ListInsert_Sq(head, j, j); 
		//cout << head.elem[j-1] << endl;
		ListInsert_Sq(list, j, j+5);
	}
	cout << "打印线性表：" << endl;
	PrintList(head);
	PrintList(list);
	cout << "删除线性表元素：" << endl;
	LintDelet_Sq(list, 2);
	PrintList(list);
	cout << "合并线性表：" << endl;
	MergeList_Sq(head, list, comb);
	PrintList(comb);
	cout << "= == == == == == 单链表操作 == == == == == " << endl;
	LinkList La;
	LinkList Lb, Lc;
	int e;
	CreateList(La, 5);
	PrintLinkList(La);
	CreateList(Lb, 6);
	PrintLinkList(Lb);
	/*CreateList(Lc, 0);*/
	GetElem_L(La, 3, e);
	cout << e << endl;
	PrintLinkList(La);
	ListInsert_L(La, 3, e);
	PrintLinkList(La);
	ListDelete_L(La, 4, e);
	PrintLinkList(La);
	CreateList(Lc, 11);
	MergeList_L(La, Lb, Lc);
	PrintLinkList(Lc);
	getchar();
}