C++ 解法, 执行用时: 1ms, 内存消耗: 496KB, 提交时间: 2017-10-24

class ReverseStack {
public:
    vector<int> reverseStackRecursively(vector<int> stack, int top) {
        int original_size=top;
        reverseStackRecursively(stack,original_size,top-1);
        return stack;
    }
    void reverseStackRecursively(vector<int> &stack,int original_size,int store_index)
    {
        if(store_index>=0)
        {
            int tmp=stack[store_index];
            reverseStackRecursively(stack,original_size,store_index-1);
            stack[original_size-store_index-1]=tmp;
        }
    }
};

C++ 解法, 执行用时: 3ms, 内存消耗: 436KB, 提交时间: 2021-09-23

class ReverseStack {
public:
    vector<int> reverseStackRecursively(vector<int> stack, int top) {
        // write code here
        reverse(stack.begin(),stack.end());
        return stack;
    }
};