-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAddTwoNumbers.h
83 lines (72 loc) · 1.77 KB
/
AddTwoNumbers.h
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
74
75
76
77
78
79
80
81
82
83
//
// AddTwoNumbers.h
//
//
// https://leetcode.com/problems/add-two-numbers/description/
//
#ifndef AddTwoNumbers_h
#define AddTwoNumbers_h
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode *result = new ListNode(0);
ListNode *currentNode = result;
bool greaterThan9 = false;
while (l1 != NULL || l2 != NULL)
{
int v1 = 0;
int v2 = 0;
if (l1 != NULL)
{
v1 = l1->val;
}
if (l2 != NULL)
{
v2 = l2->val;
}
int tempValue = v1 + v2;
if (greaterThan9)
{
tempValue++;
}
currentNode->val = tempValue % 10;
if (tempValue > 9)
{
greaterThan9 = true;
}
else
{
greaterThan9 = false;
}
if (l1 != NULL)
{
l1 = l1->next;
}
if (l2 != NULL)
{
l2 = l2->next;
}
if (l1 != NULL || l2 != NULL)
{
currentNode->next = new ListNode(0);
currentNode = currentNode->next;
}
}
if (greaterThan9)
{
currentNode->next = new ListNode(0);
currentNode = currentNode->next;
currentNode->val++;
}
return result;
}
};
#endif /* AddTwoNumbers_h */