-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy path0002-Add-Two-Numbers.cpp
More file actions
executable file
·65 lines (55 loc) · 1.66 KB
/
Copy path0002-Add-Two-Numbers.cpp
File metadata and controls
executable file
·65 lines (55 loc) · 1.66 KB
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
/**
* You are given two non-empty linked lists representing two non-negative
* integers. The digits are stored in reverse order and each of their nodes
* contain a single digit. Add the two numbers and return it as a linked list.
*
* You may assume the two numbers do not contain any leading zero, except the
* number 0 itself.
*
* Example:
*
* Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 0 -> 8
* Explanation: 342 + 465 = 807.
*/
#include "../utils/MyListUtil.h"
#include <iostream>
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode *pHead = new ListNode(0);
ListNode *pCurrent = pHead;
auto carry = 0;
while (l1 != nullptr || l2 != nullptr || carry != 0) {
auto op1 = 0, op2 = 0;
if (l1 != nullptr) {
op1 = l1->val;
l1 = l1->next;
}
if (l2 != nullptr) {
op2 = l2->val;
l2 = l2->next;
}
auto sum = op1 + op2 + carry;
carry = sum / 10;
ListNode *node = new ListNode(sum % 10);
pCurrent->next = node;
pCurrent = node;
}
auto *ret = pHead->next;
delete pHead;
return ret;
}
};
int main() {
Solution solution;
ListNode *l1 = new ListNode(0), *l2 = new ListNode(0); // head doesn't mean anything
int a1[3] = {2, 4, 3};
int a2[3] = {5, 6, 4};
myGenerateList(l1, a1, 3);
myGenerateList(l2, a2, 3);
auto* listRes = solution.addTwoNumbers(l1->next, l2->next);
auto* p = listRes;
myDispList(p);
// process terminate, heap will be reclaimed.
}