-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAdd Two Numbers.cpp
More file actions
56 lines (52 loc) · 1.41 KB
/
Add Two Numbers.cpp
File metadata and controls
56 lines (52 loc) · 1.41 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
/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (l1 == NULL) {
return l2;
} else if (l2 == NULL) {
return l1;
}
int carry = 0;
ListNode *head = new ListNode(-1);
ListNode *pre = head;
while (l1 && l2) {
int sum = l1->val + l2->val + carry;
carry = sum / 10;
sum = sum % 10;
ListNode *cur = new ListNode(sum);
pre->next = cur;
pre = cur;
l1 = l1->next;
l2 = l2->next;
}
if (l2 != NULL) {
l1 = l2;
}
while (l1 != NULL) {
int sum = l1->val + carry;
carry = sum / 10;
sum = sum % 10;
ListNode *cur = new ListNode(sum);
pre->next = cur;
pre = cur;
l1 = l1->next;
}
if (carry == 1) {
ListNode *cur = new ListNode(1);
pre->next = cur;
pre = cur;
}
pre->next = NULL;
return head->next;
}
};