已知一个单链表lc={a1,b1,a2,b2….,an,bn} 共２ｎ个元素，设计一个算法将其拆分成二个带头结点的单向链表la 与lb,其中la={a1,a2,.an},lb={b1,b2,..bn}

/*
已知一个带头结点的单链表lc={a1,b1,a2,b2….,an,bn}
共２ｎ个元素，试设计一个算法将其拆分成二个带头结点的
单向链表la 与lb,其中la={a1,a2,…an},lb={b1,b2,…,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 p, end;
	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 splitlinklist(linklist &l1, linklist &l2, linklist &l3)
{
	l2 = (linklist) malloc (sizeof(Node));
	l3 = (linklist) malloc (sizeof(Node));
	linklist p, q, s;
	p = l1->next; 
	q = l2;
	s = l3;
	int j = 1;

	while(p)
	{
		if(j%2 != 0)
		{
			q->next = p;
			q = q->next;
		}
		else
		{
			s->next = p;
			s = s->next;
		}
		j++;
		p = p->next;
	}
	q->next = NULL;
	s->next = NULL;
}

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

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

	inlinklist(l1, n);
	splitlinklist(l1, l2, l3);
	outlinklist(l2);
	outlinklist(l3);

	return 0;
}