合并两个排序的链表

非递归版本

#include<iostream>
using namespace std;

struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) :
            val(x), next(NULL) {
    }
};

class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2){
        if(pHead1 == NULL)
            return pHead2;
        if(pHead2 == NULL)
            return pHead1;
        ListNode *current = new ListNode(-1);//生成一个新的链表
        ListNode *root = current;//头指针
        while(pHead1 && pHead2){
            if(pHead1->val<pHead2->val){
                current->next = pHead1;
                current = pHead1;
                pHead1 = pHead1->next;
            }else{
                current->next = pHead2;
                current = pHead2;
                pHead2 = pHead2->next;
            }
        }
        if(pHead1){
            current->next = pHead1;
        }
        if(pHead2){
            current->next = pHead2;
        }
        return root->next;
    }
};

int main(){
    ListNode *Node = new ListNode(1);
    Node->next = new ListNode(3);
    Node->next->next = new ListNode(5);
    ListNode *Node2 = new ListNode(2);
    Node2->next = new ListNode(4);
    Node2->next->next = new ListNode(6);
    Solution s;
    s.Merge(Node, Node2);
    return 0;
}

递归版本：

class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2){
        if(pHead1 == NULL)
            return pHead2;
        if(pHead2 == NULL)
            return pHead1;
        ListNode *pMergedHead = NULL;
        if(pHead1->val < pHead2->val){
            pMergedHead = pHead1;
            pMergedHead ->next = Merge(pHead1->next, pHead2);
        }else{
            pMergedHead = pHead2;
            pMergedHead ->next = Merge(pHead1, pHead2->next);
        }
        return pMergedHead;
    }
};