-
Notifications
You must be signed in to change notification settings - Fork 19
Expand file tree
/
Copy pathAddTwoNumbers.java
More file actions
executable file
·99 lines (76 loc) · 2.45 KB
/
Copy pathAddTwoNumbers.java
File metadata and controls
executable file
·99 lines (76 loc) · 2.45 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
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
import java.util.ArrayList;
import java.util.List;
/**
* 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.
* <p>
* Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 0 -> 8
* <p>
* Result: Accepted
*/
public class AddTwoNumbers {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode tmp1 = l1.next;
ListNode tmp2 = l2.next;
List<ListNode> results = new ArrayList<>();
boolean addOne = l1.val + l2.val >= 10;
ListNode result = new ListNode((l1.val + l2.val) % 10);
if (addOne) {
result.next = new ListNode(1);
}
results.add(result);
while (true) {
if (tmp1 == null && tmp2 == null) {
break;
} else {
int tmp = 0;
if (tmp1 == null) {
tmp = tmp2.val;
} else if (tmp2 == null) {
tmp = tmp1.val;
} else {
tmp = tmp1.val + tmp2.val;
}
if (addOne) {
tmp += 1;
}
addOne = tmp >= 10;
result = new ListNode(tmp % 10);
if (addOne) {
result.next = new ListNode(1);
}
results.add(result);
if (tmp1 != null) {
tmp1 = tmp1.next;
}
if (tmp2 != null) {
tmp2 = tmp2.next;
}
}
}
ListNode rst = results.get(0);
for (int i = 1; i < results.size(); i++) {
rst.next = results.get(i);
rst = rst.next;
}
return results.get(0);
}
public static class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
}
@Override
public boolean equals(Object obj) {
if (obj instanceof ListNode) {
ListNode node = (ListNode) obj;
return this.next == null && node.next == null || this.val == node.val && (this.next != null) && this.next.equals(node.next);
}
return false;
}
}
}