【LeetCode】Merge Two Sorted Lists

description:

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.

code: (注意不能申请新的结点空间，必须原地操作)

/**
 * 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) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(l1 == NULL && l2 == NULL )
            return NULL;
        if(l1 == NULL || l2 == NULL)
            return l1 == NULL ? l2 : l1;
        ListNode *head, *cur;
        head = NULL;
        cur = NULL;
        while(l1 != NULL && l2 != NULL)
        {
            ListNode *small = l1->val < l2->val ? l1 : l2;
            if(cur == NULL)
            {
                head = small;
                cur = small;
            }
            else
            {
                cur->next = small;
                cur = cur->next;
            }
            if(small == l1)
                l1 = l1->next;
            else l2 = l2->next;
        }
        if(l1 == NULL)
            cur->next = l2;
        else cur->next = l1;
        return head;
    }
};