LeetCode 21. Merge Two Sorted Lists

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.

题目大意是将两个有序的链表合并成一个链表。

 这道题比较简单，直接上代码了。

/**
 * 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) 
    {
        if( !l1)
        return l2;
    if(!l2)
        return l1;
    ListNode *head = NULL;
    ListNode *node = NULL;
    if(l1->val < l2->val)
    {
        head = node = l1;
        l1 = l1->next;
    }
    else
    {
        head = node = l2;
        l2 = l2->next;
    }

    node ->next = NULL;
    while(l1 && l2)
    {
        if(l1->val < l2->val)
        {
            node->next = l1;
            l1 = l1->next;
            node =node->next;
            node->next = NULL;
        }
        else
        {
            node->next = l2;
            l2 = l2->next;
            node = node->next;
            node->next = NULL;
        }
    }
    if(l1)
        node->next = l1;
    else if (l2)
        node->next = l2;
    return head;

    }
};