-
Notifications
You must be signed in to change notification settings - Fork 0
/
AddTwoNumbers.java
85 lines (64 loc) · 2.18 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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode focusedNode1 = l1;
int length1 = 0;
int length2 = 0;
ListNode focusedNode2 = l2;
while(focusedNode1 != null) {
length1++;
focusedNode1 = focusedNode1.next;
}
while(focusedNode2 != null) {
length2++;
focusedNode2 = focusedNode2.next;
}
if(length1 == 0 && length2 == 0) return null;
if(length1 >= length2) {
focusedNode1 = l1;
focusedNode2 = l2;
} else {
focusedNode1 = l2;
focusedNode2 = l1;
}
ListNode newList = null;
ListNode resultRoot = null;
int carry = 0;
while(focusedNode2 != null) {
int value = focusedNode1.val + focusedNode2.val;
int toAdd = (value + carry) % 10;
if(newList == null) {
newList = new ListNode(toAdd);
resultRoot = newList;
} else {
ListNode actualNode = new ListNode(toAdd);
newList.next = actualNode;
newList = actualNode;
}
focusedNode1 = focusedNode1.next;
focusedNode2 = focusedNode2.next;
carry = (value + carry) / 10;
}
while(focusedNode1 != null) {
int value = focusedNode1.val;
int toAdd = (value + carry) % 10;
ListNode actualNode = new ListNode(toAdd);
newList.next = actualNode;
newList = actualNode;
carry = (value + carry) / 10;
focusedNode1 = focusedNode1.next;
}
if(carry != 0) {
ListNode actualNode = new ListNode(carry);
newList.next = actualNode;
}
return resultRoot;
}
}