栈的逆序

import java.util.Stack;

public class pro3_reverseStack {
    public static int getAndRemovelastElement(Stack<Integer> stack) {
        int result = stack.pop();
        if(stack.isEmpty()) {
            return result ;
        }
        else {
            int last = getAndRemovelastElement(stack) ;
            stack.push(result) ;
            return last ;
        }
    }
    
    public static void reverse(Stack<Integer> stack) {
        if(stack.isEmpty()) {
            return ;
        }
        
        int i = getAndRemovelastElement(stack) ;
        reverse(stack) ;
        stack.push(i) ;
    }
}