Repository navigation
Expand file tree
/
Copy pathAdd Two Numbersv.cpp
More file actions
73 lines (64 loc) · 1.72 KB
/
Copy pathAdd Two Numbersv.cpp
File metadata and controls
73 lines (64 loc) · 1.72 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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
// Link Of Problem
// https://leetcode.com/problems/add-two-numbers/
// 2. Add Two Numbers
/**
* 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*ans = nullptr, *tail = nullptr;
while(l1 != nullptr && l2 != nullptr){
ListNode* temp = new ListNode(l1->val + l2->val);
if(ans == nullptr){
ans = tail = temp;
}
else{
tail->next = temp;
tail = temp;
}
l1 = l1->next;
l2 = l2->next;
}
while(l1 != nullptr){
ListNode* temp = new ListNode(l1->val);
if(ans == nullptr){
ans = tail = temp;
}
else{
tail->next = temp;
tail = temp;
}
l1 = l1->next;
}
while(l2 != nullptr){
ListNode* temp = new ListNode(l2->val);
if(ans == nullptr){
ans = tail = temp;
}
else{
tail->next = temp;
tail = temp;
}
l2 = l2->next;
}
ListNode* cur = ans, *prev = nullptr;
int res = 0;
while(cur != nullptr){
res += cur->val;
cur->val = res % 10;
res /= 10;
prev = cur;
cur = cur->next;
}
if(res)prev->next = new ListNode(res);
return ans;
}
};