//任务:将带头结点的链表A分解为两个带头结点的A和B,A中含有序号为奇数的元素,B序号为偶数
//算法思想,将A中偶数的摘下来放到B中,奇数的留下
void Dis_create(LinkList& A, LinkList &B)
{
int i = 1;
LNode* pre=A, * p = A->next;
LNode* r = B;
while (p)
{
if (i % 2 == 0)
{
pre->next = p->next;
r->next = p;
r = p;
p = pre->next;
i++;
}
else
{
pre = p; p = p->next; i++;
}
}
r->next = NULL;
}