-
Notifications
You must be signed in to change notification settings - Fork 13
/
Copy pathAddTwoNumbers.java
64 lines (49 loc) · 1.27 KB
/
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
package problems.leetcode;
/**
* https://leetcode.com/problems/add-two-numbers/
*/
public class AddTwoNumbers {
private static class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
}
}
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if (l1 == null) {
return l2;
} else if (l2 == null) {
return l1;
}
int sum = l1.val + l2.val, carry = 0;
if (sum >= 10) {
sum -= 10;
carry = 1;
}
ListNode sumHead = new ListNode(sum), sumTail = sumHead;
l1 = l1.next;
l2 = l2.next;
while (l1 != null || l2 != null) {
sum = carry + (l1 != null ? l1.val : 0) + (l2 != null ? l2.val : 0);
if (sum >= 10) {
sum -= 10;
carry = 1;
} else {
carry = 0;
}
sumTail.next = new ListNode(sum);
sumTail = sumTail.next;
if (l1 != null) {
l1 = l1.next;
}
if (l2 != null) {
l2 = l2.next;
}
}
if (carry > 0) {
sumTail.next = new ListNode(carry);
}
return sumHead;
}
}