将单链表拆分为两个特定的单链表

题目要求：有一个带头结点的单链表L={a,A,b,B,c,C,d,D}，设计一个算法将其拆分成 两个带头结点的单链表L1和L2,其中L1={a,b,c,d},L2={D,C,B,A}。

思路：L1用尾插法构建，L2用头插法构建。

#include<iostream>
using namespace std;
typedef char ElemType;
//定义单链表结构体
struct LinkList
{
	ElemType data;
	LinkList* next;
};
//头插法建立单链表
void CreateListF(LinkList* &L, ElemType a[], const int n)
{
	//L = new LinkList;
	L = (LinkList*)malloc(sizeof(LinkList));
	L->data = NULL;
	L->next = NULL;
	for (int i = 0; i < n; ++i)
	{
		LinkList* s = (LinkList*)malloc(sizeof(LinkList));
		s->data = a[i];
		s->next = L->next;
		L->next = s;
	}
}
//尾插法建立单链表
void CreateListR(LinkList* &L, ElemType a[], const int n)
{
	L = (LinkList*)malloc(sizeof(LinkList));
	L->data = NULL;
	L->next = NULL;
	LinkList* r = L;
	for (int i = 0; i < n; ++i)
	{
		LinkList* s = (LinkList*)malloc(sizeof(LinkList));
		s->data = a[i];
		s->next = NULL;
		r->next = s;
		r = s;
	}
}
//输出单链表
void DisplayList(LinkList* L)
{
	cout << "单链表输出为： ";
	LinkList* p = L->next;
	while (p != NULL)
	{
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
void main()
{
	LinkList* L, *L1, *L2;
	L = L1 = L2 = NULL;
	const int n = 8;
	ElemType a[n] = { 'a','A','b','B','c','C','d','D'};
	CreateListR(L, a, n);//构建原始单链表
	cout << "原始";
	DisplayList(L);
	//扫描原始单链表，得到用于构建L1,L2的数组
	ElemType a1[n / 2], a2[n / 2];
	LinkList* p = L->next;
	int k = 0;
	while (p != NULL)
	{
		int j = k % 2;
		if (j == 0)
		{
			a1[k/2] = p->data;
		}
		else
		{
			a2[k / 2] = p->data;
		}
		++k;
		p = p->next;
	}
	//构建L1,L2
	CreateListR(L1, a1, n / 2);
	CreateListF(L2, a2, n / 2);
	//输出拆分后的单链表L1,L2
	cout << "L1";
	DisplayList(L1);
	cout << "L2";
	DisplayList(L2);
}