-
Notifications
You must be signed in to change notification settings - Fork 27
Expand file tree
/
Copy pathAdd Two Numbers.cpp
More file actions
58 lines (53 loc) · 1.31 KB
/
Add Two Numbers.cpp
File metadata and controls
58 lines (53 loc) · 1.31 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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution
{
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2)
{
ListNode* result = new ListNode(0);
ListNode* l3 = result;
int carry = 0;
while (l1 != NULL && l2 != NULL)
{
int sum = l1->val + l2->val + carry;
l3->next = new ListNode(sum % 10);
carry = sum / 10;
l1 = l1->next;
l2 = l2->next;
l3 = l3->next;
}
while (l1 != NULL)
{
int sum = l1->val + carry;
l3->next = new ListNode(sum % 10);
carry = sum / 10;
l1 = l1->next;
l3 = l3->next;
}
while (l2 != NULL)
{
int sum = l2->val + carry;
l3->next = new ListNode(sum % 10);
carry = sum / 10;
l2 = l2->next;
l3 = l3->next;
}
while (carry != 0)
{
l3->next = new ListNode(carry % 10);
carry /= 10;
l3 = l3->next;
}
l3 = result;
result = l3->next;
delete l3;
return result;
}
};