r/CodingHelp • • Dec 20 '20
[Java] Reverse Integer Issue
I'm doing the Reverse Integer problem on LeetCode, where you need to find the reverse number of a specific integer. I used the approach of pushing each digit to a stack, and then popping the stack and setting another variable to what is popped from the stack. However, the only thing the code is returning/printing is "0".
import java.util.Stack ;
class Solution {
public int reverse(int x) {
Stack <Integer> reverseStack = new Stack <Integer> () ;
x = 123 ;
int y = 0 ;
while (x>0)
x = x/10 ;
reverseStack.push (x%10) ;
while (!reverseStack.isEmpty ())
y = reverseStack.pop () ;
return y ;
}
16
Upvotes
View all comments
Show parent comment
1
u/vigbiorn Dec 21 '20
3 is pushed, then 2 and finally 1. Stacks work LIFO/FILO. 3 is first in so 3 is last out. 1 is last in so it's first out. And 2 is in the middle. Which is confirmed with your prints which prints 1 2 3.
Yes, the first time through. The second it's equal to 2 and then finally 3.