-
Notifications
You must be signed in to change notification settings - Fork 16
Expand file tree
/
Copy pathaddTowNumbers.cpp
More file actions
64 lines (54 loc) · 1.37 KB
/
addTowNumbers.cpp
File metadata and controls
64 lines (54 loc) · 1.37 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
#include <iostream>
// leetcode 2. Add Two Numbers
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* dummy{new ListNode()};
ListNode* temp{dummy};
int carry{0};
while(l1!=NULL || l2!=NULL || carry){
int sum=0;
if(l1!=NULL){
sum+=l1->val;
l1=l1->next;
}
if(l2!=NULL){
sum+=l2->val;
l2=l2->next;
}
sum+=carry;
carry=sum/10;
ListNode* newnode=new ListNode(sum%10);
temp->next=newnode;
temp=temp->next;
}
return dummy->next;
}
};
int main()
{
ListNode* l1 = new ListNode(2);
l1->next = new ListNode(4);
l1->next->next = new ListNode(3);
ListNode* l2 = new ListNode(5);
l2->next = new ListNode(6);
l2->next->next = new ListNode(4);
ListNode* res = Solution{}.addTwoNumbers(l1, l2);
ListNode* tmp;
tmp = res;
while(tmp != NULL)
{
std::cout<<tmp->val;
tmp = tmp->next;
}
return 0;
}