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

import java.util.Stack;

public class Problem03_ReverseStackUsingRecursive {
    
    /*
     * 递归得到栈底元素
     */
    public static int getAndRemoveLastElement(Stack<Integer> stack){
        int result = stack.pop();
        if (stack.isEmpty()){
            return result;            
        } else {
            int lastElement = getAndRemoveLastElement(stack);
            stack.push(result);
            return lastElement;
        }        
    }
    
    /*
     * 逆序
     */
    public static void reverse(Stack<Integer> stack) {
        if (stack.isEmpty()) {
            return;
        }
        int i = getAndRemoveLastElement(stack);
        reverse(stack);
        stack.push(i);
    }
    

    public static void main(String[] args) {
        Stack<Integer> test = new Stack<Integer>();
        test.push(1);
        test.push(2);
        test.push(3);
        test.push(4);
        test.push(5);
        System.out.println(test);
        reverse(test);

        System.out.println(test); 

        while (!test.isEmpty()) {
            System.out.println(test.pop());
        }

    }

}

[1, 2, 3, 4, 5]
[5, 4, 3, 2, 1]
1
2
3
4
5