用递归函数和栈操作逆序一个栈

#include <stack>
#include <stdio.h>
using namespace std;

int GetAndRemoveBottom(stack<int> &ss)
{
    int top, bottom;
    top = ss.top();
    ss.pop();
    if(ss.empty())
        return top;
    bottom = GetAndRemoveBottom(ss);
    ss.push(top);
    return bottom;
}

void ReverseStack(stack<int> &ss)
{
    if(ss.empty()) return ;
    int bottom = GetAndRemoveBottom(ss);
    ReverseStack(ss);
    ss.push(bottom);
}

int main()
{
    stack<int> ss;
    for(int i = 1; i <= 5; i++)
        ss.push(i);
    ReverseStack(ss);
    while(!ss.empty())
    {
        printf("%d ", ss.top());
        ss.pop();
    }
}