1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73

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)
            return l2;
        if(l2 == NULL)
            return l1;
        int val;
        if(l1->val < l2->val)
        {
            val = l1->val;
            l1 = l1->next;
        }
        else
        {
            val = l2->val;
            l2 = l2 ->next;
        }
        ListNode * l = new ListNode(val);
        ListNode * lcopy = l;
        int flag = 0;
        while(true)
        {
            if(l1 == NULL)
            {
                flag = 1;
                break;
            }
            if(l2 == NULL)
            {
                flag = 2;
                break;
            }
            if(l1->val < l2->val)
            {
                val = l1->val;
                l1 = l1->next;
            }
            else
            {
                val = l2->val;
                l2 = l2 ->next;
            }
            ListNode * tmp = new ListNode(val);
            lcopy->next = tmp;
            lcopy = lcopy->next;
        }
        if(flag == 1)
        {
            while(l2 != NULL)
            {
                val = l2->val;
                l2 = l2->next;
                ListNode * tmp = new ListNode(val);
                lcopy->next = tmp;
                lcopy = lcopy->next;
            }
        }
        if(flag == 2)
        {
            while(l1 != NULL)
            {
                val = l1->val;
                l1 = l1->next;
                ListNode * tmp = new ListNode(val);
                lcopy->next = tmp;
                lcopy = lcopy->next;
            }
        }
        return l;
    }
};