LeetCode155 Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

push(x) – Push element x onto stack.
pop() – Removes the element on top of the stack.
top() – Get the top element.
getMin() – Retrieve the minimum element in the stack.
Example:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> Returns -3.
minStack.pop();
minStack.top(); --> Returns 0.
minStack.getMin(); --> Returns -2.

class MinStack {
    long min;
    Stack<Long> stack;
    /** initialize your data structure here. */
    public MinStack() {
        stack = new Stack<Long>();
    }
    
    public void push(int x) {
        if(stack.isEmpty()){
            stack.push(0l);
            min = x;
        }else{
            stack.push(x - min);
            if(x < min) min = x;
        }
    }
    
    public void pop() {
        long pop = stack.pop();
        if(pop < 0) min = min - pop;
    }
    
    public int top() {
        if(stack.peek() < 0){
            return (int)this.min;
        }else{
            return (int)(stack.peek() + min);
        }
    }
    
    public int getMin() {
        return (int)this.min;
    }
}

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack obj = new MinStack();
 * obj.push(x);
 * obj.pop();
 * int param_3 = obj.top();
 * int param_4 = obj.getMin();
 */