store/works/solutions/leetcode/cpp/2.cpp


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

struct ListNode
{
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution
{
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2)
    {
        ListNode *result;
        ListNode *tail;
        int carry = 0;

        {
            int sum = l1->val + l2->val;
            if (sum > 9)
            {
                carry = 1;
                sum -= 10;
            }

            result = new ListNode(sum);
            tail = result;

            l1 = l1->next;
            l2 = l2->next;
        }

        while (l1 || l2)
        {
            int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + carry;
            if (sum > 9)
            {
                carry = 1;
                sum -= 10;
            }
            else
            {
                carry = 0;
            }
            tail->next = new ListNode(sum);
            tail = tail->next;

            if (l1)
                l1 = l1->next;
            if (l2)
                l2 = l2->next;
        }

        if (carry)
        {
            tail->next = new ListNode(1);
        }

        return result;
    }
};

int main()
{
    ListNode *l1 = new ListNode(2);
    l1->next = new ListNode(4);
    l1->next = new ListNode(3);

    ListNode *l2 = new ListNode(5);
    l2->next = new ListNode(6);
    l2->next = new ListNode(4);

    ListNode *result = Solution{}.addTwoNumbers(l1, l2);

    return 0;
}