-
Notifications
You must be signed in to change notification settings - Fork 0
/
2. Add Two Numbers 2.cpp
58 lines (47 loc) · 1.18 KB
/
2. Add Two Numbers 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
// https://leetcode.com/problems/add-two-numbers/
/**
* 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)
{
ListNode *result = new ListNode();
ListNode *current = result;
vector<int> values;
int sum = 0;
int carry = 0;
while (l1 != nullptr || l2 != nullptr)
{
sum = carry;
if (l1 != nullptr)
{
sum += l1->val;
l1 = l1->next;
}
if (l2 != nullptr)
{
sum += l2->val;
l2 = l2->next;
}
carry = sum / 10;
values.push_back(sum % 10);
}
if (carry != 0)
values.push_back(carry);
for (int &value : values)
{
current->next = new ListNode(value);
current = current->next;
}
return result->next;
}
};