leetcode 21. Merge Two Sorted Lists

没有加新的链表，而是在原有的链表基础上进行next的修改。

ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
    ListNode * ret = NULL , *p = NULL;
    if(l1 == NULL)return ret = l2;
    if(l2 == NULL)return ret = l1;
    if(l2->val<l1->val){
        ret = l2;
        l2 = l2->next;
    }else{
        ret = l1;
        l1 = l1->next;
    }
    p = ret;

    while(l1!= NULL && l2!=NULL){
        if(l1->val<l2->val){
            p->next = l1;
            l1 = l1->next;
            p = p->next;
        }else{
            p->next = l2;
            l2 = l2->next;
            p = p->next;
        }
    }
    if(l1 == NULL)p->next = l2;
    else p->next = l1;
    return ret;

}