题目描述
定义栈的数据结构,请在该类型中实现一个能够得到栈中所含最小元素的min函数(时间复杂度应为O(1))。
解题思路
看书知道了开一个辅助栈,用于存放最小的值
Code
class Solution {
public:
int data1[10000], minData[10000];
int pHead = 0;
void push(int value) {
data1[pHead] = value;
if(pHead == 0) {
minData[pHead] = value;
} else {
if(minData[pHead-1] > value) {
minData[pHead] = value;
} else {
minData[pHead] = minData[pHead-1];
}
}
pHead++;
}
void pop() {
if(pHead > 0) {
pHead--;
}
}
int top() {
if(pHead < 0) {
//
}
return data1[pHead-1];
}
int min() {
if(pHead < 0) {
//
}
return minData[pHead-1];
}
};
- java
import java.util.Stack;
public class Solution {
private Stack<Integer> stack = new Stack<Integer>();
private Stack<Integer> minStack = new Stack<Integer>();
public void push(int node) {
stack.push(node);
if(minStack.isEmpty() || node < minStack.peek()) {
minStack.push(node);
} else {
minStack.push(minStack.peek());
}
}
public void pop() {
stack.pop();
minStack.pop();
}
public int top() {
return stack.peek();
}
public int min() {
return minStack.peek();
}
}