链表逆序的递归非递归算法，两个链表head1和head2各自有序，合并一个有序（保留所有节点，即使大小相等）的递归非递归算法

//============================================================================ // Name : C++链表题一个链表的结点结构.cpp // Author : // Version : // Copyright : Your copyright notice // Description : Hello World in C++, Ansi-style //============================================================================ #include <iostream> using namespace std; struct Node { int date; Node*next; Node(int Date=0):date(Date),next(NULL){} }; typedef struct Node Node; Node* ReverseList1(Node *head) { if(head==NULL||head->next==NULL) return head; Node*q=head->next; Node*r=ReverseList1(head->next); q->next=head; head->next=NULL; return r; } Node* ReverseList(Node *head) { if(head==NULL||head->next==NULL) return head; Node *p=head; Node *q=NULL; Node *r=NULL; while(p) { r=p->next; p->next=q; q=p; p=r; } return q; } void create(Node **Head,int date) { Node*head=*Head; Node *p=new Node(date); if(!head) { *Head=p; } else { p->next=(*Head); //(*Head)->next=p; (*Head)=p; } } Node* MergeRecursion(Node* head1,Node *head2) { Node *p=NULL; if(head1==NULL) return head2; if(head2==NULL) return head1; if(head1->date<head2->date) { p=MergeRecursion( head1->next,head2); head1->next=p; return head1; } if(head1->date>head2->date) { p=MergeRecursion( head1,head2->next); head2->next=p; return head2; } if(head1->date==head2->date) { p=MergeRecursion( head1->next,head2->next); head2->next=head1; head1->next=p; return head2; } } Node* Merge(Node* head1,Node *head2) { Node *head=NULL; Node *s=NULL; Node*p=NULL; Node *q=NULL; Node *temp=NULL; Node *temp1=NULL; for(p=head1,q=head2;p!=NULL&&q!=NULL;) { if(p->date<q->date) { temp=p->next; if(head==NULL) { head=p; s=head; } else { s->next=p; s=s->next; } p=temp; } else if(p->date>q->date) { temp=q->next; if(head==NULL) { head=q; s=head; } else { s->next=q; s=s->next; } q=temp; } else if(p->date==q->date) { temp=q->next; temp1=p->next; if(head==NULL) { head=q; head->next=p; s=head->next; } else { s->next=q; s=s->next; s->next=p; s=s->next; } q=temp; p=temp1; } } if(p) { s->next=p; } if(q) { s->next=q; } return head; } void print(Node *p) { while(p) { cout<<p->date<<" "; p=p->next; } cout<<endl; } int main() { Node *head; head=new Node(1); head->next=new Node(2); Node *p=head->next; p->next=new Node(3); p->next->next=new Node(4); Node *temp= ReverseList1(head); p=temp; while(p) { cout<<p->date<<" "; p=p->next; } cout<<endl<<"merge"<<endl; Node *head1=NULL; Node *head2=NULL; create(&head1,8); create(&head1,4); create(&head1,2); create(&head1,1); create(&head2,10); create(&head2,9); create(&head2,6); create(&head2,4); create(&head2,3); print(head1); print(head2); Node *s= MergeRecursion(head1,head2); print(s); return 0; }