leetcode/Add_Two_Numbers.cpp at main · kevinsun203/leetcode · 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

//Definition for singly-linked list.
struct ListNode {
    int val;
    ListNode *next;
    ListNode() : val(0), next(nullptr) {}
    ListNode(int x) : val(x), next(nullptr) {}
    ListNode(int x, ListNode *next) : val(x), next(next) {}
};

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        bool firstDigit = true;
        ListNode* newHead = new ListNode(0);
        ListNode* lag;
        int carry = 0;
        int newDigit;

        while (l1 != nullptr || l2 != nullptr) {

            // Get value of both nodes
            int l1Val = l1 == nullptr ? 0 : l1->val;
            int l2Val = l2 == nullptr ? 0 : l2->val;

            // Get digit
            newDigit = l1Val + l2Val + carry;

            // Create carry for next digit
            if (newDigit >= 10) {
                carry = newDigit / 10;
                newDigit = newDigit % 10;
            } else {
                carry = 0;
            }

            if (firstDigit) {
                newHead->val = newDigit;
                firstDigit = false;
                lag = newHead;
            } else {
                lag->next = new ListNode(newDigit);
                lag = lag->next;
            }

            // Get next node
            l1 = l1 == nullptr || l1->next == nullptr ? nullptr : l1->next;
            l2 = l2 == nullptr || l2->next == nullptr ? nullptr : l2->next;

        }

        // If the final digit has a carry, create another node
        if (carry != 0) {
            lag->next = new ListNode(carry);
        }

        return newHead;
    }
};