11,设C=a, ,a, b2,., an,D为线性表,采用带头结点的hc单链表存放,设计一个就地 算法,将其拆分为两个线性表,使得A={a, a2, an, B={b),., , b

思路：遍历hc, 奇数项节点用尾插法插入A,偶数项节点用尾插法插入B

 

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<stack>
using namespace std;
// 链表节点结构
typedef struct Node{
	int data;
	struct Node * next;
	Node(): next(NULL){};
	Node(int data):data(data), next(NULL){};
}Node, *LinkList;


 
void divorce(LinkList &L, LinkList &A, LinkList &B){
	Node *p = L->next;
	Node *q = A;
	while(p){
		Node *f = p->next;
		p->next = NULL;
		q->next = p;
		q = q->next;
		
		if(f){
			p = f->next;
			f->next = B->next;
			B->next = f;
		}else{
			p = f;
		}
	}
}

 
// 输出有头结点的单链表
void show(LinkList L){
    Node *p = L->next;
    while(p){
        cout<<p->data<<" ";
	p = p->next;
    }
    cout<<endl;
} 
 
// 头插创建链表 
void createListFromHead(vector<int> v, LinkList &L){
	// 创建头 
	L = new Node(); 
	
	// 生成链表 
	for(int i=0; i<v.size(); i++){
		Node *p = new Node(v.at(i));
		p->next = L->next;
		L->next = p;
	} 
} 
 
int main(){
	int a[]={1,1,2,2,3,3};
	vector<int> V(a, a+6);
	LinkList L;
	createListFromHead(V, L);
	LinkList A = new Node();
	LinkList B = new Node();
	divorce(L, A, B);
	show(A);
	show(B);
 
	
	return 0;
}