LeetCode Min Stack

class MinStack {
    Stack<Integer> seqStack = new Stack<Integer>();
    Stack<Integer> minStack = new Stack<Integer>();
    public void push(int x) {
        int curMin;
        if(minStack.isEmpty()){
            curMin = Integer.MAX_VALUE;
        } else{
            curMin = minStack.peek();
        }
        if(x <= curMin) minStack.push(x);
        seqStack.push(x);
    }

    public void pop() {
        if(seqStack.isEmpty()) return;
        else {
            int removedValue = seqStack.pop();
            if(removedValue == minStack.peek()){
                minStack.pop();
            }
          }
    }

    public int top() {
        return seqStack.peek();
    }

    public int getMin() {
        return minStack.peek();
    }
}