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.

题目很简单，就是考察队链表插入的熟悉程度。
12ms。
代码：

/**
 * 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* tail=NULL, *head=NULL;
        if( l1 == NULL)//链表1为空
        {
            head = l2;
            return head;
        }
        if(l2 == NULL)//链表2为空
        {
            head = l1;
            return head;
        }
        if(l1->val <= l2->val)//确定头结点
        {
            head = l1;
            l1 = head->next;
            tail=head;
        }
        else
        {
            head = l2;
            l2 = head->next;
            tail=head;
        }

        while( l1 != NULL && l2 != NULL)//融合剩余的节点
        {
            if(l1->val <= l2->val)
            {
                tail->next = l1;
                tail = l1;
                l1 = tail->next;
            }
            else
            {
                tail->next = l2;
                tail = l2;
                l2 = tail->next;
            }
        }
        //当其中一个链表到达尾端，将另外一个链表直接接到结果链表的后面
        if( l1 != NULL)
        {
            tail->next = l1;
        }
        else 
            tail->next = l2;
        return head;
    }
};