-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2_AddTwoNumbers.cpp
49 lines (48 loc) · 1.13 KB
/
2_AddTwoNumbers.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
// 2. Add Two Numbers - 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 dummy(0);
ListNode *p = &dummy;
int carry = 0;
int sum = 0;
while (l1 || l2)
{
sum = carry;
if (l1)
sum += l1->val;
if (l2)
sum += l2->val;
if (sum >= 10)
{
carry = sum / 10;
sum = sum % 10;
}
else
{
carry = 0;
}
p->next = new ListNode(sum);
p = p->next;
if (l1)
l1 = l1->next;
if (l2)
l2 = l2->next;
}
if (carry)
p->next = new ListNode(carry);
return dummy.next;
}
};