LeetCode 155. 最小栈

Categories:

题目描述
思路分析
参考代码
相似题目

题目描述

🔥 155. 最小栈

思路分析

思路描述

参考代码

type MinStack struct {
	stack    []int // 正常操作的栈
	minStack []int // 存储当前栈中的最小值的栈
}

func Constructor() MinStack {
	return MinStack{}
}

func (this *MinStack) Push(val int) {
	this.stack = append(this.stack, val)
	if len(this.minStack) == 0 || val <= this.GetMin() {
		this.minStack = append(this.minStack, val)
	}
}

func (this *MinStack) Pop() {
	if this.stack[len(this.stack)-1] == this.GetMin() {
		this.minStack = this.minStack[:len(this.minStack)-1]
	}
	this.stack = this.stack[:len(this.stack)-1]
}

func (this *MinStack) Top() int {
	return this.stack[len(this.stack)-1]
}

func (this *MinStack) GetMin() int {
	return this.minStack[len(this.minStack)-1]
}

🍏 点击查看 Java 题解

class MinStack {
    private final Stack<Integer> stack;
    private final Stack<Integer> minStack;

    public MinStack() {
        stack = new Stack<>();
        minStack = new Stack<>();
    }

    public void push(int val) {
        stack.push(val);
        if (minStack.isEmpty() || val <= minStack.peek()) {
            minStack.push(val);
        }
    }

    public void pop() {
        int val = stack.pop();
        if (val == minStack.peek()) {
            minStack.pop();
        }
    }

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

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

相似题目

题目	难度	题解
滑动窗口最大值	Hard
最大栈	Hard

本文作者: HGNULB

本文链接: https://hgnulb.github.io/blog/87592375