-
Notifications
You must be signed in to change notification settings - Fork 0
/
add_two_numbers.cpp
58 lines (51 loc) · 1.16 KB
/
add_two_numbers.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
// 2. Add Two Numbers: https://leetcode.com/problems/add-two-numbers
// Author: [email protected]
#include <assert.h>
struct ListNode
{
int val;
ListNode *next;
ListNode(int x) : val(x), next(nullptr) { }
};
// Iterative
class Solution
{
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2)
{
ListNode head(0);
ListNode* ptr = &head;
int carry = 0;
while (l1 != nullptr || l2 != nullptr)
{
int val = carry;
if (l1 != nullptr)
{
val += l1->val;
l1 = l1->next;
}
if (l2 != nullptr)
{
val += l2->val;
l2 = l2->next;
}
carry = val / 10;
val %= 10;
ptr->next = new ListNode(val);
ptr = ptr->next;
}
if (carry > 0)
{
ptr->next = new ListNode(carry);
}
return head.next;
}
};
int main(int argc, char* argv[])
{
ListNode* l1 = nullptr;
ListNode* l2 = nullptr;
ListNode* l3 = Solution().addTwoNumbers(l1, l2);
assert(l3 == nullptr);
return 0;
}