-
Notifications
You must be signed in to change notification settings - Fork 0
/
17thJULYdailyleet.java
50 lines (41 loc) · 1.24 KB
/
17thJULYdailyleet.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
/**
* 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; }
* }
*/
class Solution {
public ListNode helper(ListNode l1, ListNode l2) {
Stack<Integer> stack1 = new Stack<>();
Stack<Integer> stack2 = new Stack<>();
while (l1 != null) {
stack1.push(l1.val);
l1 = l1.next;
}
while (l2 != null) {
stack2.push(l2.val);
l2 = l2.next;
}
ListNode result = null;
int carry = 0;
while (!stack1.empty() || !stack2.empty() || carry != 0) {
int digit1 = !stack1.empty() ? stack1.pop() : 0;
int digit2 = !stack2.empty() ? stack2.pop() : 0;
int sum = digit1 + digit2 + carry;
int digit = sum % 10;
carry = sum / 10;
ListNode newNode = new ListNode(digit);
newNode.next = result;
result = newNode;
}
return result;
}
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode ans = helper(l1, l2);
return ans;
}
}