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