LeetCodeProblems/mergeSortedList.cpp at main · iambharatks/LeetCodeProblems · GitHub

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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <bits/stdc++.h>

using namespace std;

struct ListNode
{
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
    ListNode() : val(0), next(nullptr) {}
    ListNode(int x, ListNode *next) : val(x), next(next) {}
};
class Solution
{
public:
    ListNode *mergeTwoLists(ListNode *l1, ListNode *l2)
    {
        ListNode *head = NULL;
        ListNode **headref = &head;
        while (l1 && l2)
        {
            if (l1->val <= l2->val)
            {
                *headref = new ListNode(l1->val);
                l1 = l1->next;
                headref = &((*headref)->next);
            }
            else
            {
                *headref = new ListNode(l2->val);
                l2 = l2->next;
                headref = &((*headref)->next);
            }
        }
        while (l1)
        {
            *headref = new ListNode(l1->val);
            l1 = l1->next;
            headref = &((*headref)->next);
        }
        while (l2)
        {
            *headref = new ListNode(l2->val);
            l2 = l2->next;
            headref = &((*headref)->next);
        }
        return head;
    }
};

class Solution
{
public:
    ListNode *mergeTwoLists(ListNode *l1, ListNode *l2)
    {
        ListNode *head = NULL;
        ListNode **headref = &head;
        while (l1 && l2)
        {
            if (l1->val <= l2->val)
            {
                *headref = l1;
                l1 = l1->next;
                headref = &((*headref)->next);
            }
            else
            {
                *headref = l2;
                l2 = l2->next;
                headref = &((*headref)->next);
            }
        }
        while (l1)
        {
            *headref = l1;
            l1 = l1->next;
            headref = &((*headref)->next);
        }
        while (l2)
        {
            *headref = l2;
            l2 = l2->next;
            headref = &((*headref)->next);
        }
        return head;
    }
};