题解 | #合并两个排序的链表#

/* struct ListNode { int val; struct ListNode next; ListNode(int x) : val(x), next(NULL) { } };/ class Solution { public: ListNode* Merge(ListNode* pHead1, ListNode* pHead2) { ListNode* prehead = new ListNode(0) ;

    ListNode* preptr = prehead ;
    while(pHead1 && pHead2)
    {
        if(pHead1-> val < pHead2 -> val)
        {
            preptr->next = pHead1 ;
            pHead1 = pHead1->next ;
            preptr = preptr ->next ;
        }
        else
        {
            preptr->next = pHead2 ;
            pHead2 = pHead2 ->next ;
            preptr = preptr ->next ;
        }
    }
    if( !pHead1)
        preptr ->next = pHead2;
    else
        preptr -> next = pHead1 ;
    return prehead -> next ;
}

};