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

import java.util.Stack;

public class GetAndRemoveLastAndReverse {
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);
}
}