-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAddTwoNumbers.cpp
37 lines (37 loc) · 961 Bytes
/
AddTwoNumbers.cpp
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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* c1 = l1;
ListNode* c2 = l2;
ListNode* ans = new ListNode(0);
ListNode* temp = ans;
int sum = 0;
while(c1!=NULL || c2!=NULL){
sum = sum/10;
if(c1!=NULL){
sum+=c1->val;
c1 = c1->next;
}
if(c2!=NULL){
sum+=c2->val;
c2 = c2->next;
}
temp->next = new ListNode(sum%10);
temp=temp->next;
}
if(sum/10 > 0){
temp->next = new ListNode(1);
}
return ans->next;
}
};