Min Stack | LeetCode | Java

class MinStack { Stack<Integer> stack; Stack<Integer> minStack; public MinStack() { stack = new Stack<>(); minStack = new Stack<>(); } public void push(int val) { int min = val; if(!minStack.isEmpty() && minStack.peek()<min) min = minStack.peek(); stack.push(val); minStack.push(min); } public void pop() { stack.pop(); minStack.pop(); } public int top() { return stack.peek(); } public int getMin() { return minStack.peek(); } }