（一）线性表的链式实现及相关操作实现

（前言）考研在即，数据结构是重头戏，以前学的不是很好，很多东西都是想着还明白但是用代码实现却很困难。为了考研，也为了以后的工作，我觉得有必要花些精力来好好学习一下数据结构同时也希望借此提高自己的编程能力。用日志的方式来记录我的代码，同时也记录我的考研历程，希望我能坚持下去...加油！

ps：也希望各位高手指教！在这里先谢谢了！

#include<iostream>
using namespace std;
/**
author:hendery
content:单链表的顺序和逆序实现、求链表长度、插入元素、删除元素、两个有序链表的归并、定位某个元素在链表中的位置、查找某一位置元素的值
time:2012.3.19
*/
#define FALSE -1
struct Node
{
	int data;
	struct Node *next;
};

Node *CreatList()//正序创建单链表
{
	Node *head,*r,*node;
	head = (Node*)malloc(sizeof(Node));

	head->next=NULL;
	r=head;

	int i=1;
	while(true)
	{
		node = (Node*)malloc(sizeof(Node));
		cout<<"输入第"<<i++<<"节点值"<<endl;
			cin>>node->data;
		if(node->data==0)//以0作为输入的结束，但是0不插入链表
			break;
		r->next = node;
		r=r->next;
	}
	r->next = NULL;
	cout<<endl;

	return head;//返回指向链表头结点的指针

}
Node *CreatList_Reversed_Order()//逆序创建单链表
{
	Node *head,*node;
	head = (Node*)malloc(sizeof(Node));

	head->next = NULL;
	
	int i = 1;
	while(true)
	{
		node = (Node*)malloc(sizeof(Node));
		cout<<"第"<<i++<<"个要插入的节点的值为"<<endl;
			cin>>node->data;
		if(node->data==-1)//以输入-1作为结束，-1不插入链表
			break;
		
		node->next = head->next;
		head->next = node;
	}
	return head;
}

int length(Node *head)//求链表的长度
{
	int i = 0;
	Node *temp;
	temp=head;
	while(temp->next)
	{
		temp=temp->next;
		i++;
	}
	return i;
}

Node *insert(Node *head,int i,int data)//i表示在第几个位置插入
{
	if(i>length(head))//插入位置错误
	{
		cout<<"error"<<endl;
		return NULL;
	}
	Node *p;
	p=head;
	int j=1;
	while(p&&j<i)
	{
		p=p->next;
		j++;
	}
	Node *s;
	s=(Node*)malloc(sizeof(Node));
	s->next=p->next;
	p->next=s;
	s->data = data;
	return head;
}

Node *delete_element_list(Node *head,int i)
{
	Node *p;
	p=head;
	int j = 0;
	if(i>length(head)||i<1)
	{
		cout<<"error"<<endl;
		return NULL;
	}
	while(p->next&&j<i-1)
	{
		p=p->next;
		j++;
	}
	Node *q;
	q=p->next;
	//if(q->next==NULL)
	//{
		//p->next=NULL;
		//free(q);
	//}
	p->next=q->next;
	free(q);
	return head;
}

Node *merge(Node *head1,Node *head2)//将两个线性表归并为一个线性表
{
	Node *node1,*node2,*head,*temp;//temp是合并后的链表头指针
	node1 = head1->next;
	node2 = head2->next;
	if(node1->data<=node2->data)
		temp = head1;
	else
		temp = head2;
	head = temp;
	while(node1&&node2)
	{
		if(node1->data<=node2->data)
		{
			head->next = node1;
			head = node1;
			node1 = node1->next; 
		}
		else
		{
			head->next = node2;
			head = node2;
			node2 = node2->next;
		}
	}
	if(node1)//head1链表还存在
	{
		head->next = node1;
	}
	if(node2)
	{
		head->next=node2;//head2链表还存在
	}
	return temp;

}

int LocateElement(Node *head,int element)//定位某个元素在链表中第一次出现的位置
{
	Node *temp;
	temp = head->next;
	int i = 1;
	while(temp->data!=element)
	{
		temp = temp->next;
		i++;
		if(temp==NULL)
			return (length(head)+1);
	}
	return i;

}

void Search(Node *head,int i)//输出第i位置元素的值
{
	int l = length(head);
	if(i>l)
	{
		cout<<"error"<<endl;
		return;
	}
	Node *temp;
	temp = head;
	int j = 0;
	while(temp&&j<=i)
	{
		j++;
		temp=temp->next;
	}
	cout<<"第"<<i<<"个元素的值为"<<temp->data<<endl;
}

void print(Node *head)//打印链表
{
	Node *node;
	node = head->next;
	cout<<"链表中的元素有：";
	while(node)
	{
		cout<<node->data<<" ";
		node = node->next;
	}
	cout<<endl;
}



int main()
{
	Node *head;
	head = CreatList();
	cout<<"一";
	print(head);

	Node *headByReverse;
	headByReverse=CreatList_Reversed_Order();
	print(headByReverse);



	int location;
	cout<<"输入要查询的元素位置"<<endl;
	cin>>location;
	Search(head,location);
	

	Node *head1;
	head1 = CreatList();
	cout<<"二";
	print(head1);

	Node *headOfMergeList;
	headOfMergeList = merge(head,head1);
	cout<<"合并后的："<<endl;
	print(headOfMergeList);

	int i;
	int data;
	cout<<"要插入的节点位置为"<<endl;
	cin>>i;
	cout<<"要插入的值为"<<endl;
	cin>>data;
	insert(headOfMergeList,i,data);
	print(headOfMergeList);


	int j;
	cout<<"要删除的节点位置"<<endl;
	cin>>j;
	delete_element_list(headOfMergeList,j);
	cout<<"删除后的链表为："<<endl;
	print(headOfMergeList);

	int element;
	cout<<"输入要查找的元素值"<<endl;
	cin>>element;
	if(LocateElement(head,element)>length(head))
		cout<<"链表中不存在该元素！"<<endl;
	else
	cout<<"要查找的元素在链表中的位置为："<<LocateElement(headOfMergeList,element);

	system("pause");

}