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

#include<iostream>
#include<stack>
using namespace std;

int getBottomElement(stack<int> &s) {
    int cur = s.top();
    s.pop();
    if (s.empty()) {
        return cur;
    } else {
        int bottom = getBottomElement(s);
        s.push(cur);
        return bottom;
    }
}
void reverse(stack<int> &s) {
    if (s.empty()) {
        return;
    } 
    int bottom = getBottomElement(s);
    reverse(s);
    s.push(bottom);
}
int main()
{
    int n, num;
    cin >> n;
    stack<int> s;
    for (int i = 0; i < n; ++i) {
        cin >> num;
        s.push(num);
        cout << num << " ";
    }
    cout << endl;
    reverse(s);
    while (!s.empty()) {
        cout << s.top() << " ";
        s.pop();
    }
    cout << endl;

    system("pause");
    return 0;
}