-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathadd two numbers.cpp
45 lines (45 loc) · 1.14 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
/**
* 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* l3 = new ListNode(0);
ListNode* head = l3;
int carry = 0;
while(l1 && l2)
{
int val = l1->val + l2->val + carry;
carry = val/10;
l3->next = new ListNode(val%10);
l1=l1->next;
l2=l2->next;
l3=l3->next;
}
while(l1)
{
int val = l1->val + carry;
carry = val/10;
l3->next = new ListNode(val%10);
l1=l1->next;
l3=l3->next;
}
while(l2)
{
int val =l2->val + carry;
carry = val/10;
l3->next = new ListNode(val%10);
l2=l2->next;
l3=l3->next;
}
if(carry) l3->next = new ListNode(carry);
return head->next;
}
};