-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path002-AddTwoNumbers.cpp
More file actions
66 lines (54 loc) · 1.5 KB
/
002-AddTwoNumbers.cpp
File metadata and controls
66 lines (54 loc) · 1.5 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
//-----------------------------------------------------------------------------
// Runtime: 36ms
// Memory Usage:
// Link:
//-----------------------------------------------------------------------------
#include "stdafx.h"
#include "002-AddTwoNumbers.h"
namespace LeetCode
{
_002_AddTwoNumbers::_002_AddTwoNumbers()
{
}
_002_AddTwoNumbers::~_002_AddTwoNumbers()
{
}
int getValueAndMoveNext(ListNode **node)
{
if (*node == nullptr) { return 0; }
int value = (*node)->val;
*node = (*node)->next;
return value;
}
ListNode *calculateNext(ListNode **node, ListNode **l1, ListNode **l2)
{
int value1 = getValueAndMoveNext(l1);
int value2 = getValueAndMoveNext(l2);
int sum = value1 + value2 + (*node)->val;
if (sum >= 10)
{
(*node)->val = sum % 10;
(*node)->next = new ListNode(1);
}
else
{
(*node)->val = sum;
(*node)->next = new ListNode(0);
}
return *node;
}
ListNode * _002_AddTwoNumbers::addTwoNumbers(ListNode *l1, ListNode *l2)
{
ListNode *first = new ListNode(-1);
first->next = new ListNode(0);
ListNode *current = first;
while (l1 != nullptr || l2 != nullptr)
{
current = calculateNext(&(current->next), &l1, &l2);
}
if (current->next->val == 0) {
current->next = nullptr;
}
return first->next;
}
}