-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2.add-two-numbers.cpp
74 lines (59 loc) · 1.44 KB
/
2.add-two-numbers.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
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
/*
* @lc app=leetcode id=2 lang=cpp
*
* [2] Add Two Numbers
*/
// @lc code=start
/**
* 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) {}
* };
*/
#include <iostream>
using namespace std;
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* ptr = nullptr;
ListNode* start;
int nodeCnt = 0;
int roundUp = 0;
while(l1 || l2) {
int arg1 = 0;
int arg2 = 0;
if(l1) arg1 = l1->val;
if(l2) arg2 = l2->val;
int res = arg1 + arg2 + roundUp;
if(res >= 10) {
res %= 10;
roundUp = 1;
}
else {
roundUp = 0;
}
if(ptr == nullptr) {
ptr = new ListNode(res);
start = ptr;
}
else {
ListNode* old = ptr;
ptr = new ListNode(res);
old->next = ptr;
}
if(l1) l1 = l1->next;
if(l2) l2 = l2->next;
}
if(roundUp) {
ListNode* old = ptr;
ptr = new ListNode(1);
old->next = ptr;
}
return start;
}
};
// @lc code=end