链表的合并升序，降序，求交集

1.要求将两个链表合成新的一个链表，不malloc新的空间

//两条升序的链表合并成一条降序的链表
LinkList merge_LinkList1(LinkList L1, LinkList L2)
{
	LinkList C;
	Lnode *p, *q, *s;
	p = L1->next;	q = L2->next;
	C = L1;	C->next = NULL;						//以L1的头结点建立新的链表
	free(L2);
	while (p&&q)
	{
		if (p->data >= q->data)
		{
			s = q;  q = q->next;
			s->next = C->next;
			C->next = s;
		}
		else
		{
			s = p;  p = p->next;
			s->next = C->next;
			C->next = s;
		}
	}
	if (!p)	p = q;
	while (p)
	{
		s = p;  p = p->next;
		s->next = C->next;
		C->next = s;
	}
	return C;
}

2.将两个升序的链表合成一个新的升序链表（不开辟新的空间）

代码↓↓↓

//两条升序的链表合并成一条升序的链表(无重复)
LinkList merge_LinkList2(LinkList L1, LinkList L2)
{
	LinkList C;
	Lnode *p, *q, *s, *r;			
	p = L1->next;	q = L2->next;
	C = L1;	C->next = NULL;
	r = C;								// *r 指向当前链表的表尾结点
	free(L2);
	while (p&&q)
	{
		if (p->data >= q->data)
		{
			s = q;
			q = q->next;
			r->next = s; r = s;
		}
		else
		{
			s = p;
			p = p->next;
			r->next = s; r = s;
		}
	}
	if (!p)	p = q;						//连接剩下的未处理的链表
	while (p)
	{
		s = p;
		p = p->next;
		r->next = s; r = s;
	}
	pur_LinkList(C);					//清除掉重复的结点
	return C;
}

一般来说，求并集不具有重复性，附上清除重复函数的代码

void pur_LinkList(LinkList L) {
	Lnode *p, *s, *q;
	p = L->next;
	if (!p)	return;
	while (p->next)
	{
		q = p;
		while (q->next)				//固定p所指结点，向后遍历，寻找与之数据域相同的结点
		{
			if (q->next->data == p->data)	//在这里将q->next所指的结点存放数据与p作比较
			{
				s = q->next;
				q->next = s->next;
				free(s);
			}
			else q = q->next;
		}
		p = p->next;
	}
}

上面 merge_LinkList2(L1,L2)算法改进的 merge_LinkList22(L1,L2) 函数，无需pur_LinkList()函数,先对结点预选，如前一结点重复，则释放删除当前目标结点，再向后遍历链表，执行代码如下：

//两条升序的链表合并成一条升序的链表(无重复) 改进法
LinkList merge_LinkList22(LinkList L1, LinkList L2)
{
	LinkList C;
	Lnode *p, *q, *tail, *s,*s1;	//*s指向要操作的目标结点，*s1指向当两条链中某两结点值相同时L2所对应的那个结点，便于清除该结点
	int f = flag;
	p = L1->next, q = L2->next;
	tail = C = L1;		C->next = NULL;
	free(L2);
	while (p&&q)
	{
		if (p->data > q->data)
		{
			s = q;	q = q->next;	
		}
		else if (p->data < q->data)
		{
			s = p;	p = p->next;
		}
		else						//如果相同则删掉L2中的结点
		{
			s = p;	p = p->next;
			s1 = q;	q = q->next;	free(s1);
		}
		if (f != s->data)
		{
			s->next = tail->next;
			tail->next = s; tail = s;
			f = s->data;
		}
		else   free(s);
	}
	if (!p)
		p = q;
	while (p)
	{
		s = p;	p = p->next;
		if (f != s->data)
		{
			s->next = tail->next;
			tail->next = s; tail = s;
			f = s->data;
		}
		else free(s);
	}
	return C;
}

3.最后来一段老师给的作业——求升序链表的交集（不改变原先链表）

（里面的flag是define好的特定的值）代码如下：

//两个升序的链表求交集，得到的新的升序链表
LinkList Union_LinkList(LinkList L1, LinkList L2) 
{
	Lnode *p, *q, *s,*r,*temp;
	LinkList  C;
	int f = flag;							//f存放新链表的表尾结点的数值，用于比对，预设为一个不常用的数值
	p = L1->next;	q = L2->next;
	r = C = (Lnode*)malloc(sizeof(Lnode));	//创建C链表的头结点,*r为表尾结点
	C->next = NULL;
	while (p)
	{
		if (f != p->data)
		{	
			s = q;
			while (s)
			{
				if (s->data == p->data) {
					temp = (Lnode*)malloc(sizeof(Lnode));
					temp->data = p->data;
					temp->next = r->next;
					r->next = temp;
					r = temp;
					break;
				}
				if (s->data > p->data) break;
				s = s->next;	q = s;
			}
		}
		f = p->data;
		p = p->next;
	}
	return C;
}