- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cpp
More file actions
Latest commit
28 lines (28 loc) · 729 Bytes
/
Copy pathSolution.cpp
File metadata and controls
28 lines (28 loc) · 729 Bytes
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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
classSolution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* res = newListNode(0);
ListNode* iter = res;
int carry=0;
while(l1 || l2 || carry) {
int sum = 0;
if (l1) { sum += l1->val; l1=l1->next; }
if (l2) { sum += l2->val; l2=l2->next; }
sum+=carry;
carry=sum/10;
sum=sum%10;
ListNode* next = newListNode(sum);
iter->next = next;
iter = iter->next;
}
return res->next;
}
};