forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 1
/
_2.java
31 lines (28 loc) · 971 Bytes
/
_2.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
package com.fishercoder.solutions;
import com.fishercoder.common.classes.ListNode;
public class _2 {
public static class Solution1 {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode result = new ListNode(0);
ListNode tmp = result;
int sum = 0;
while (l1 != null || l2 != null) {
sum /= 10;
if (l1 != null) {
sum += l1.val;
l1 = l1.next;
}
if (l2 != null) {
sum += l2.val;
l2 = l2.next;
}
tmp.next = new ListNode(sum % 10);
tmp = tmp.next;
}
if (sum / 10 == 1) {
tmp.next = new ListNode(1);//this means there's a carry, so we add additional 1, e.g. [5] + [5] = [0, 1]
}
return result.val == 0 ? result.next : result;
}
}
}