LeetCode--155--easy--MinStack

summary:

consider each node in the stack having a minmium value

package myapp.kit.leetcode.top100liked;

import java.util.ArrayList;
import java.util.List;

/**
 * 155
 * easy
 * https://leetcode.com/problems/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 1:
 *
 * Input
 * ["MinStack","push","push","push","getMin","pop","top","getMin"]
 * [[],[-2],[0],[-3],[],[],[],[]]
 *
 * Output
 * [null,null,null,null,-3,null,0,-2]
 *
 * Explanation
 * MinStack minStack = new MinStack();
 * minStack.push(-2);
 * minStack.push(0);
 * minStack.push(-3);
 * minStack.getMin(); // return -3
 * minStack.pop();
 * minStack.top();    // return 0
 * minStack.getMin(); // return -2
 *
 *
 * Constraints:
 *
 * Methods pop, top and getMin operations will always be called on non-empty stacks.
 *
 * @author huangdingsheng
 * @version 1.0, 2020/5/6
 */
public class MinStack {

    private int min = Integer.MAX_VALUE;
    private List<Integer> list = new ArrayList<>();
    /** initialize your data structure here. */
    public MinStack() {

    }

    public void push(int x) {
        if (x < min) {
            min = x;
        }
        list.add(x);
        list.add(min);
    }

    public void pop() {
        list.remove(list.size() - 1);
        list.remove(list.size() - 1);
        if (list.size() > 0) {
            min = list.get(list.size() - 1);
        } else {
            min = Integer.MAX_VALUE;
        }
    }

    public int top() {
        return list.get(list.size() - 2);
    }

    public int getMin() {
        return 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();
     */
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值