-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathaddTwoNumbers.cpp
More file actions
39 lines (39 loc) · 1.04 KB
/
addTwoNumbers.cpp
File metadata and controls
39 lines (39 loc) · 1.04 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
/**
* 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 *h = new ListNode(0);
ListNode *p = h;
int temp = 0;
while(l1 != NULL && l2 != NULL) {
p->next = new ListNode((temp + l1->val + l2->val) % 10);
temp = (temp + l1->val + l2->val) / 10;
p = p->next;
l1 = l1->next;
l2 = l2->next;
}
while(l1 != NULL) {
p->next = new ListNode((temp + l1->val) % 10);
temp = (temp + l1->val) / 10;
p = p->next;
l1 = l1->next;
}
while(l2 != NULL) {
p->next = new ListNode((temp + l2->val) % 10);
temp = (temp + l2->val) / 10;
p = p->next;
l2 = l2->next;
}
if(temp) {
p->next = new ListNode(1);
}
return h->next;
}
};