-
Notifications
You must be signed in to change notification settings - Fork 20
/
AddtwoNodes.java
38 lines (38 loc) · 1.03 KB
/
AddtwoNodes.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
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
public class AddtwoNodes {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode result = new ListNode(0);
ListNode current = result;
int overflow = 0;
while(l1 != null || l2 != null){
int sum = 0;
sum += l1 != null ? l1.val : 0;
sum += l2 != null ? l2.val : 0;
sum += overflow;
overflow = 0;
while(sum >= 10){
sum -= 10;
overflow++;
}
current.val = sum;
l1 = l1 != null ? l1.next : null;
l2 = l2 != null ? l2.next : null;
if(l1 == null && l2 == null){
current.next = overflow > 0 ? new ListNode(overflow) : null;
}else{
current.next = new ListNode(0);
}
current = current.next;
}
return result;
}
}