forked from varunu28/LeetCode-Java-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAdd Two Numbers II.java
More file actions
67 lines (59 loc) · 1.66 KB
/
Add Two Numbers II.java
File metadata and controls
67 lines (59 loc) · 1.66 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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/**
* 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 l1Rev = reverse(l1);
ListNode l2Rev = reverse(l2);
ListNode ans = new ListNode(-1);
ListNode curr = ans;
int carry = 0;
while (l1Rev != null || l2Rev != null) {
int temp = 0;
if (l1Rev != null && l2Rev != null) {
temp = l1Rev.val + l2Rev.val + carry;
l1Rev = l1Rev.next;
l2Rev = l2Rev.next;
}
else if(l1Rev != null) {
temp = l1Rev.val + carry;
l1Rev = l1Rev.next;
}
else {
temp = l2Rev.val + carry;
l2Rev = l2Rev.next;
}
if (temp > 9) {
carry = temp/10;
temp = temp%10;
}
else {
carry = 0;
}
curr.next = new ListNode(temp);
curr = curr.next;
}
if (carry != 0) {
curr.next = new ListNode(carry);
curr = curr.next;
}
return reverse(ans.next);
}
private ListNode reverse(ListNode head) {
ListNode curr = head;
ListNode prev = null;
ListNode next = null;
while (curr != null) {
next = curr.next;
curr.next = prev;
prev = curr;
curr = next;
}
return prev;
}
}