Merge Two Sorted Lists —— Leetcode（再做一遍）

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

很简单的一道题，为什么做的时候就意识模糊了呢？

另外，注意头结点解决边界条件的方法，不需要事先将链表头给head.next。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode head(0);
        ListNode *prev = &head;
        while(l1 && l2)
        {
            if(l1->val < l2->val)
            {
                prev->next = l1;
                l1 = l1->next;
            }
            else
            {
                prev->next = l2;
                l2 = l2->next;
            }
            prev = prev->next;
        }
        
        prev->next = l1?l1:l2;
        
        return head.next;
    }
};