class MinStack {
public:
/** initialize your data structure here. */
vector<int>obj;
MinStack() {
}
void push(int x) {
obj.push_back(x);
}
void pop() {
obj.pop_back();
}
int top() {
return obj[obj.size()-1];
}
int getMin()
{
int temp=obj[0];
for(int i=0;i<obj.size();i++)
{
if(temp>=obj[i])
{
temp=obj[i];
}
}
return temp;
}
};
/**
* 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();
*/
LeetCode:155. 最小栈
最新推荐文章于 2020-11-30 22:13:50 发布