-
Notifications
You must be signed in to change notification settings - Fork 73
Expand file tree
/
Copy pathAddTwoNumbers.java
More file actions
53 lines (48 loc) · 1.2 KB
/
AddTwoNumbers.java
File metadata and controls
53 lines (48 loc) · 1.2 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
package algorithm.lc;
/**
* 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
*
*/
public class AddTwoNumbers {
public class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
next = null;
}
}
// O(n) space, O(n) time
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
// Start typing your Java solution below
// DO NOT write main() function
ListNode head = new ListNode(0);
ListNode cur = head;
int carry = 0;
while (l1 != null || l2 != null) {
int digit = carry;
if (l1 != null) {
digit += l1.val;
l1 = l1.next;
}
if (l2 != null) {
digit += l2.val;
l2 = l2.next;
}
carry = digit / 10;
digit %= 10;
cur.next = new ListNode(digit);
cur = cur.next;
}
if (carry == 1) {
cur.next = new ListNode(carry);
}
return head.next;
}
}
}