-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAddTwoNumbers.java
54 lines (45 loc) · 1.06 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
package linkedlist;
import linkedlist.LinkedListTest.ListNode;
/**
* @author Shogo Akiyama
* Solved on 08/18/2019
*
* 2. Add Two Numbers
* https://leetcode.com/problems/add-two-numbers/
* Difficulty: Medium
*
* Approach: Recursion
* Runtime: 1 ms, faster than 100.00% of Java online submissions for Add Two Numbers.
* Memory Usage: 44.5 MB, less than 86.83% of Java online submissions for Add Two Numbers.
*
* @see LinkedListTest#testAddTwoNumbers()
*/
public class AddTwoNumbers {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
add(l1, l2, null, 0);
return l1;
}
private void add(ListNode n1, ListNode n2, ListNode prev, int carry) {
if (n1 == null && n2 == null) {
if (carry == 1) {
prev.next = new ListNode(1);
}
return;
}
ListNode next;
if (n1 == null || n2 == null) {
n1 = (n1 == null) ? n2 : n1;
next = null;
} else {
n1.val += n2.val;
next = n2.next;
}
n1.val += carry;
carry = n1.val / 10;
n1.val %= 10;
if (prev != null) {
prev.next = n1;
}
add(n1.next, next, n1, carry);
}
}