/
_0002_AddTwoNumbers.java
199 lines (191 loc) · 6.03 KB
/
_0002_AddTwoNumbers.java
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
package com.diguage.algorithm.leetcode;
import com.diguage.algorithm.util.ListNode;
import com.diguage.algorithm.util.ListNodeUtils;
import java.util.Arrays;
import java.util.Objects;
import static com.diguage.algorithm.util.ListNodeUtils.printListNode;
/**
* = 2. Add Two Numbers
*
* https://leetcode.com/problems/add-two-numbers/description/[Add Two Numbers - LeetCode]
*
* You are given two non-empty linked lists representing two non-negative
* integers. 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.
*
* You may assume the two numbers do not contain any leading zero, except the number 0 itself.
*
* .Example:
* [source]
* ----
* Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 0 -> 8
* Explanation: 342 + 465 = 807.
* ----
*
* @author D瓜哥, https://www.diguage.com/
* @since 2018-09-17 11:42
*/
public class _0002_AddTwoNumbers {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
// ListNode h1 = l1;
// ListNode h2 = l2;
// ListNode mergeList = null;
// int carryOver = 0;
// while (Objects.nonNull(h1) && Objects.nonNull(h2)) {
// int v1 = h1.val;
// int v2 = h2.val;
// int newVal = v1 + v2 + carryOver;
// if (newVal >= 10) {
// carryOver = 1;
// newVal -= 10;
// } else {
// carryOver = 0;
// }
// ListNode listNode = new ListNode(newVal);
// listNode.next = mergeList;
// mergeList = listNode;
// h1 = h1.next;
// h2 = h2.next;
// }
//
// ListNode rest = null;
// if (Objects.nonNull(h1)) {
// rest = h1;
// }
// if (Objects.nonNull(h2)) {
// rest = h2;
// }
//
// ListNode restHead = rest;
// while (Objects.nonNull(rest) && carryOver > 0) {
// int newVal = rest.val + carryOver;
// if (newVal >= 10) {
// carryOver = 1;
// newVal -= 10;
// } else {
// carryOver = 0;
// }
// rest.val = newVal;
// if (Objects.isNull(rest.next) && carryOver > 0) {
// ListNode carryNode = new ListNode(carryOver);
// rest.next = carryNode;
// carryOver = 0;
// }
// rest = rest.next;
// }
// if (Objects.isNull(restHead) && carryOver > 0) {
// restHead = new ListNode(carryOver);
// }
//
// while (Objects.nonNull(mergeList)) {
// ListNode next = mergeList.next;
// mergeList.next = restHead;
// restHead = mergeList;
// mergeList = next;
// }
//
// return restHead;
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
ListNode result = l1;
int digit = 0;
while (Objects.nonNull(l1.next) && Objects.nonNull(l2.next)) {
int sum = l1.val + l2.val + digit;
l1.val = sum % 10;
digit = sum / 10;
l1 = l1.next;
l2 = l2.next;
}
int sum = l1.val + l2.val + digit;
l1.val = sum % 10;
digit = sum / 10;
if (Objects.isNull(l1.next) && Objects.nonNull(l2.next)) {
l1.next = l2.next;
l1 = l1.next;
}
ListNode tail = null;
;
while (digit > 0 && Objects.nonNull(l1)) {
tail = l1;
sum = l1.val + digit;
l1.val = sum % 10;
digit = sum / 10;
l1 = l1.next;
}
if (digit > 0) {
tail.next = new ListNode(digit);
}
return result;
// ListNode result = l1;
// int digit = 0;
// while (Objects.nonNull(l1.next) && Objects.nonNull(l2.next)) {
// int sum = l1.val + l2.val + digit;
// l1.val = sum % 10;
// digit = sum / 10;
// l1 = l1.next;
// l2 = l2.next;
// }
// int sum = l1.val + l2.val + digit;
// l1.val = sum % 10;
// digit = sum / 10;
// if (Objects.isNull(l1.next) && Objects.nonNull(l2.next)) {
// l1.next = l2.next;
// l1 = l1.next;
// }
// while (digit > 0 && Objects.nonNull(l1.next)) {
// sum = l1.val + digit;
// l1.val = sum % 10;
// digit = sum / 10;
// l1 = l1.next;
// }
// if (digit > 0) {
// l1.next = new ListNode(digit);
// }
// return result;
}
public static void main(String[] args) {
_0002_AddTwoNumbers result = new _0002_AddTwoNumbers();
// ListNode list1 = result.convertNumberToList(1);
// ListNode list2 = result.convertNumberToList(99);
// ListNode sum = result.addTwoNumbers(list1, list2);
// printListNode(sum);
ListNode list = result.addTwoNumbers(ListNodeUtils.build(Arrays.asList(9, 8)), ListNodeUtils.build(Arrays.asList(8)));
ListNodeUtils.printListNode(list);
}
public ListNode convertNumberToList(int number) {
ListNode result = null;
for (int i = number; i > 0; i /= 10) {
int vaule = i % 10;
ListNode listNode = new ListNode(vaule);
if (Objects.isNull(result)) {
result = listNode;
} else {
ListNode last = result;
while (Objects.nonNull(last.next)) {
last = last.next;
}
last.next = listNode;
}
}
return result;
}
}