原题目:https://leetcode-cn.com/problems/sort-of-stacks-lcci/
思路:
用栈实现插入排序(使用辅助站)
代码:
class SortedStack {
stack<int> s1,s2;
public:
SortedStack() {
}
void push(int val) {
while(!s1.empty() && s1.top()<val){
s2.push(s1.top());s1.pop();
}
s1.push(val);
while(!s2.empty()){
s1.push(s2.top());s2.pop();
}
}
void pop() {
if(s1.empty()) return;
s1.pop();
}
int peek() {
if(s1.empty()) return -1;
return s1.top();
}
bool isEmpty() {
return s1.empty();
}
};