#include<stdio.h>
#include<stdlib.h>
#include<iostream>
 
using namespace std;
 
struct Node
{
 int data;
 Node *next;
};
 
//初始化
Node *init()
{
 Node *head=new Node;
 head->next=NULL;
 return head;
}
 
//頭插法創(chuàng)建節(jié)點(diǎn)
void insetList(Node *head,int i)
{
 Node *cur=new Node;
 
 cur->data=i;
 
 cur->next=head->next;
 head->next=cur;
}
 
//鏈表A,B生成
void CreateList(Node *head_A,Node *head_B)
{
 for(int i=0;i<20;i++)
 {
  insetList(head_A,i);
  i++;
  insetList(head_B,i);
 }
 //增加鏈表B的長(zhǎng)度
 insetList(head_B,20);
 insetList(head_B,25);
}
 
void Linklist(Node *head_A,Node *head_B,Node *List_C)
{
 Node *pa=head_A->next; //pa指向鏈表A的首元節(jié)點(diǎn)
 Node *pb=head_B->next; //pa指向鏈表B的首元節(jié)點(diǎn)
 Node *pc=List_C;  //pc指向C的頭節(jié)點(diǎn)
 
 while(pa&&pb)  //某一鏈表遍歷結(jié)束即退出
 {
  pc->next=pa; //先存A鏈表的節(jié)點(diǎn)
  pc=pa;   //pc指向pa，pc前進(jìn)一個(gè)節(jié)點(diǎn)
  pa=pa->next; //pa前進(jìn)一個(gè)節(jié)點(diǎn)
 
  pc->next=pb; //存B鏈表的節(jié)點(diǎn)
  pc=pb;   
  pb=pb->next;
 }
 
 //判斷誰(shuí)先結(jié)束，然后把沒(méi)結(jié)束的剩余結(jié)點(diǎn)的鏈接上
 pc->next=pa?pa:pb; 
 
 delete head_B; //釋放鏈表B
}
 
//打印鏈表
void print(Node *head)
{
 Node *temp=head->next; //防止頭指針移動(dòng)
 while(temp)
 {
  cout<<temp->data<<" ";
  temp=temp->next;
 }
}
void main()
{
 Node *head_A=init(); //鏈表A
 Node *head_B=init(); //鏈表B
 Node *List_C=head_A; //鏈表C
 
 //創(chuàng)建鏈表A，B
 CreateList(head_A,head_B);
 
 //打印鏈表
 cout<<"鏈表A為：";
 print(head_A);
 cout<<endl<<"鏈表B為：";
 print(head_B);
 
 //合并鏈表A，B生成鏈表C
 Linklist(head_A,head_B,List_C);
 cout<<endl<<"鏈表C為："<<endl;
 print(List_C);
 
 system("pause");
 
}