Implement a "min-stack" (a data structure that behaves just like a stack in terms of push and pop but also supports a function min that returns (but does not pop) the minimum number currently on the stack)?

Implement a "min-stack" (a data structure that behaves just like a stack in terms of push and pop but also supports a function min that returns (but does not pop) the minimum number currently on the stack)?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, ntt-data, company-specific

目标公司: NTT DATA

参考答案摘要

Here is an implementation of a "min-stack" in Python: class MinStack: def __init__(self): self.stack = [] self.min_stack = [] def push(self, value): self.stack.append(value) if not self.min_stack or v...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案、收藏题目并进行模拟面试练习。