题目
- 请设计一个栈,除了常规栈支持的pop与push函数以外,还支持min函数,该函数返回栈元素中的最小值。执行push、pop和min操作的时间复杂度必须为O(1)。
示例:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.getMin(); --> 返回 -2.
代码
class MinStack {
int[] nums;
int pointer;
/** initialize your data structure here. */
public MinStack() {
this.nums = new int[10];
this.pointer = 0;
}
public void push(int x) {
if (pointer == nums.length) {
int[] ints = new int[nums.length * 2];
for (int i = 0; i < nums.length; i++) {
ints[i] = nums[i];
}
nums = ints;
}
nums[pointer] = x;
pointer++;
}
public void pop() {
nums[pointer - 1] = 0;
pointer--;
}
public int top() {
return nums[pointer - 1];
}
public int getMin() {
int min = nums[0];
for (int i = 0; i < pointer; i++) {
if (nums[i]<min) min = nums[i];
}
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();
*/
结果
用时 | 内存 |
---|---|
击败5.79% | 击败92.91% |
来源:力扣(LeetCode) 链接:https://leetcode-cn.com/problems/min-stack-lcci
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。