Merge Two Sorted Lists

一直不理解ListNode dimmy(-1)是什么意思，只会依样画葫芦，这题难度很一般

class Solution {
public:
    ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
        ListNode dummy(-1);
        ListNode *pre=&dummy;
        while(l1&&l2)
        {
            if(l1->val<l2->val)
            {
                pre->next=l1;
                l1=l1->next;
            }
            else
            {
                pre->next=l2;
                l2=l2->next;
            }
            pre=pre->next;
        }
        if(l1)
           pre->next=l1;
        else
           pre->next=l2;
        return dummy.next;
    }
};