-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2.cpp
More file actions
50 lines (50 loc) · 1.2 KB
/
2.cpp
File metadata and controls
50 lines (50 loc) · 1.2 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
/**
* 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) {
struct ListNode *head, *res;
res = head;
int carry = 0;
while(l1 && l2) {
l1->val += l2->val + carry;
carry = l1->val/10;
l1->val %= 10;
res->next = l1;
res = l1;
l1 = l1->next;
l2 = l2->next;
}
while(l1){
l1->val += carry;
carry = l1->val/10;
l1->val %= 10;
res->next = l1;
res = l1;
l1 = l1->next;
}
while(l2){
l1 = l2;
//cout<<l1->val;
l1 ->val += carry;
carry = l1->val/10;
l1->val %= 10;
res->next = l2;
res = l2;
l2 = l2->next;
}
if(carry){
ListNode *tmp = (struct ListNode*)malloc(sizeof(struct ListNode));
tmp->val =1;
tmp->next = NULL;
res->next = tmp;
}
return head->next;
}
};