用递归函数和栈操作逆序一个栈（每日一道算法题）

package stack;

import java.util.Stack;

public class RecurrenceStack {
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);
}
//测试
public static void main(String[] args) {
Stack<Integer> stack = new Stack<Integer>();
stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
reverse(stack);
System.out.print(stack.pop()+",");
System.out.print(stack.pop()+",");
System.out.print(stack.pop()+",");
System.out.print(stack.pop()+",");
}

}