-
Notifications
You must be signed in to change notification settings - Fork 0
/
Add-Two-Numbers.cpp
80 lines (64 loc) · 1.82 KB
/
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
74
75
76
77
78
79
80
/*
* Add Two Numbers
*
* You are given two linked lists representing two non-negative
* numbers. The digits are stored in reverse order and each of their
* nodes contain a single digit. Add the two numbers and return it as
* a linked list.
*
* Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 0 -> 8
*
* Song Qiang <qiang.song@usc.edu> 2012-10-10
*
* passed
*
*/
/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
assert(l1 != NULL && l2 != NULL);
ListNode* h = new ListNode((l1->val + l2->val) % 10);
int inc = (l1->val + l2->val) / 10;
ListNode* t = h;
ListNode* t1 = l1->next;
ListNode* t2 = l2->next;
while (t1 != NULL && t2 != NULL)
{
int q = (t1->val + t2->val + inc) % 10;
inc = (t1->val + t2->val + inc) / 10;
t->next = new ListNode(q);
t = t->next;
t1 = t1->next;
t2 = t2->next;
}
while (t1 != NULL)
{
int q = (t1->val + inc) % 10;
inc = (t1->val + inc) / 10;
t->next = new ListNode(q);
t = t->next;
t1 = t1->next;
}
while (t2 != NULL)
{
int q = (t2->val + inc) % 10;
inc = (t2->val + inc) / 10;
t->next = new ListNode(q);
t = t->next;
t2 = t2->next;
}
if (inc) t->next = new ListNode(inc);
return h;
}
};