-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddTwoNumbers.cpp
More file actions
54 lines (46 loc) · 1.27 KB
/
AddTwoNumbers.cpp
File metadata and controls
54 lines (46 loc) · 1.27 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
/**
* 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) {
if(!l1){
return l2;
}
if(!l2){
return l1;
}
ListNode *Result = new ListNode();
ListNode *Head = Result;
ListNode *Prev = NULL;
int Carry = 0, Sum = 0;
while(l1 || l2 || Carry){
if (Result == NULL) {
Result = new ListNode();
Prev->next = Result;
}
int First = 0, Second = 0;
if(l1){
First = l1->val;
}
if(l2){
Second = l2->val;
}
Sum = First + Second + Carry;
Carry = Sum / 10;
Result->val = Sum%10;
l1 = l1? l1->next: NULL;
l2 = l2? l2->next: NULL;
Prev = Result;
Result = Result->next;
}
return Head;
}
};