1.s1代表原来的栈
2.s2代表辅助栈
3.思路:
s1 pop,赋值给temp,temp小于等于s2栈顶元素的话,直接将temp push到s2;如果temp大于s2的栈顶元素,将s2中的元素先过渡到s1,直到temp小于或等于s2的栈顶元素(空),temp压入s2.
#include <stack>
#include <list>
#include <iostream>
using namespace std;
class StackSort {
public:
static void SortStackByStack(stack<int>& s1) {
stack<int> s2;
while (!s1.empty()) {
int temp = s1.top();
s1.pop();
while (!s2.empty() && s2.top() < temp) {
s1.push(s2.top());
s2.pop();
}
s2.push(temp);
}
while (!s2.empty()) {
cout << s2.top() << " ";
s1.push(s2.top());
s2.pop();
}
cout << endl;
}
};
int main()
{
stack<int> s1({ 2,5,3,4,1 });
StackSort::SortStackByStack(s1);
}