【leetcode腾讯精选练习】15.（Easy）最小栈

提交代码

class MinStack {
	public LinkedList<Integer> stack=new LinkedList<>(); 
    /** initialize your data structure here. */
    public MinStack() {
        
    }
    
    public void push(int x) {
        stack.add(x);
    }
    
    public void pop() {
        stack.remove(stack.size()-1);
    }
    
    public int top() {
        return stack.get(stack.size()-1);
    }
    
    public int getMin() {
    	int min=Integer.MAX_VALUE;
        for(Integer num:stack)
        	min=num<min?num:min;
        return min;
    }
}

运行结果