LeetCode-021：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

题意：

合并两个有序单链表

思路：

日常水题：Runtime: 8 ms, faster than 99.43% of C++ online submissions for Merge Two Sorted 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) {
        if(l1==NULL&&l2==NULL) return NULL;
        if(l1==NULL) return l2;
        if(l2==NULL) return l1;
        ListNode *l3,*head;
        int flag=0;
        while(l1&&l2){
            int a=l1->val,b=l2->val;
            if(a<b){
                if(!flag){
                    l3=new ListNode(a);
                    head=l3;
                    flag=1;
                }
                else{
                    head->next=new ListNode(a);
                    head=head->next;
                }
                l1=l1->next;
            }
            else if(a>b){
                if(!flag){
                    l3=new ListNode(b);
                    head=l3;
                    flag=1;
                }
                else{
                    head->next=new ListNode(b);
                    head=head->next;
                }
                l2=l2->next;
            }
            else{
                if(!flag){
                    l3=new ListNode(a);
                    head=l3;
                    flag=1;
                }
                else{
                    head->next=new ListNode(a);
                    head=head->next;
                }
                head->next=new ListNode(b);
                head=head->next;
                l1=l1->next;
                l2=l2->next;
            }
        }
        if(l1) head->next=l1;
        if(l2) head->next=l2;
        return l3;
    }
};