数据结构例11.单向链表的合并

/*
已知二个带头结点的单向链表la 与lb,
其中la={a1,a2,…an},lb={b1,b2,…,bn}， 试设计一个算法将
其合并到一个带头结点的单链表lc中，且lc={a1,b1,a2,b2….,an,bn}
*/

# include <iostream>
# include <stdlib.h>
# include <stdio.h>
using namespace std;

typedef struct Node
{
	int elem;
	struct Node* next;
}*linklist;

void inlinklist(linklist &l, int n)
{
	l = (linklist) malloc(sizeof(Node));
	l->next = NULL;
	linklist end, p;
	end = l;

	printf("请输入链表中的元素：\n");
	for(int i = 0; i<n; i++)
	{
		p = (linklist) malloc (sizeof(Node));
		scanf("%d", &p->elem);
		end->next = p;
		p->next = NULL;
		end = p;
	}
}

void outlinklist(linklist l)
{
	printf("链表中的元素为：\n");
	linklist p;
	p = l->next;
	while(p)
	{
		printf("%d ", p->elem);
		p = p->next;
	}
	printf("\n");
}

void mergerlinklist(linklist &l1, linklist &l2, linklist &l3)
{
	l3 = (linklist)malloc (sizeof(Node));
	l3->next = NULL;
	linklist p, q, s;
	p = l1->next;
	q = l2->next;
	s = l3;

	while(p && q)
	{
		s->next = p;
		s = p;
		p = p->next;
		s->next = q;
		s = q;
		q = q->next;
	}
	s->next = NULL;
}

int main()
{
	linklist l1, l2, l3;
	int n, m;

	printf("请输入链表元素个数：\n");
	scanf("%d%d", &n, &m);

	inlinklist(l1, n);
	inlinklist(l2, m);
	mergerlinklist(l1, l2, l3);
	outlinklist(l3);

	return 0;
}