题目:
思路:
代码:
class Solution
{
public:
void push(int value)
{
st_data.push(value);
if(st_assist.size()==0 || value<st_assist.top())
st_assist.push(value);
else
st_assist.push(st_assist.top());
}
int pop()
{
st_data.pop();
st_assist.pop();
}
int top()
{
return st_data.top();
}
int min()
{
return st_assist.top();
}
private:
stack<int> st_data;
stack<int> st_assist;
};