-
Notifications
You must be signed in to change notification settings - Fork 2
/
AddTwoNumbersMSBToLSB.java
83 lines (67 loc) · 2.1 KB
/
AddTwoNumbersMSBToLSB.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
package Leetcode;
import java.util.ArrayDeque;
import java.util.Deque;
/**
* @author kalpak
*
* You are given two non-empty linked lists representing two non-negative integers.
* The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
*
* You may assume the two numbers do not contain any leading zero, except the number 0 itself.
*
* Follow up:
* What if you cannot modify the input lists? In other words, reversing the lists is not allowed.
*
* Example:
*
* Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
* Output: 7 -> 8 -> 0 -> 7
*
*/
public class AddTwoNumbersMSBToLSB {
public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode head = null;
ListNode current = head;
int carry = 0;
Deque<ListNode> s1 = new ArrayDeque<>();
Deque<ListNode> s2 = new ArrayDeque<>();
while(l1 != null) {
s1.push(l1);
l1 = l1.next;
}
while(l2 != null) {
s2.push(l2);
l2 = l2.next;
}
while(!s1.isEmpty() || !s2.isEmpty() || carry != 0) {
int sum = carry;
int digit1 = 0;
int digit2 = 0;
if(!s1.isEmpty())
digit1 = s1.poll().val;
if(!s2.isEmpty())
digit2 = s2.poll().val;
sum += digit1 + digit2;
carry = sum/10;
sum = sum%10;
ListNode res = new ListNode(sum); // Add it in reverse order
res.next = current;
current = res;
}
return current;
}
public static void main(String[] args) {
ListNode l1 = new ListNode(2);
l1.next = new ListNode(4);
l1.next.next = new ListNode(3);
ListNode l2 = new ListNode(5);
l2.next = new ListNode(6);
l2.next.next = new ListNode(4);
ListNode result = addTwoNumbers(l1, l2);
while(result != null) {
System.out.print(result.val + "");
result = result.next;
}
System.out.println();
}
}