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.
Example:
Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4
分析：
合并两个有序链表，并按有序输出；
使用两个指针访问链表的每个结点。对指针所指向的结点数值进行比较：
while(l1&&l2)//两个个指针非空

1. 如果 l1->val < l2->val ，那么申请一个新的结点，把l1->val赋值进去，并且l1 = l1->next;
2. 否则将l2->val赋值进去，l2 = l2->next;
   最后分别把剩余的l1 或 l2的结点放入新的链表内

/**
 * 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 *s,*prev;
        ListNode *head =NULL;     
        while(l1 && l2)
        {
            
            if(l1->val<l2->val)
            {
                s = new ListNode(l1->val);
                if(!s)
                    return NULL;
                if(head == NULL)
                    head = s;
                else  
                {
                    prev->next = s;
                }
                prev=s;
                l1 =l1->next;
            }
            else
            {
                s = new ListNode(l2->val);
                if(!s)
                    return NULL;
                if(head == NULL)
                    head = s;
                else  
                {
                    prev->next = s;
                }
                prev=s;
                l2 =l2->next;
            }
            
        }
        while(l1)
        {
             s = new ListNode(l1->val);
                if(!s)
                    return NULL;
                if(head == NULL)
                    head = s;
                else  
                {
                    prev->next = s;
                }
                prev=s;
                l1 =l1->next;
        }
         while(l2)
        {
             s = new ListNode(l2->val);
                if(!s)
                    return NULL;
                if(head == NULL)
                    head = s;
                else  
                {
                    prev->next = s;
                }
                prev=s;
                l2 =l2->next;
        }

         return head;

    }
};