栈和队列----用递归函数和栈的操作实现逆序一个栈

package com.test;

import java.util.Stack;

/**
 * Created by Demrystv.
 */
public class ReverseStack {

    //将栈stack的栈底元素返回并且删除
    private static int getAndRemoveLastElement(Stack<Integer> stack){
        int result = stack.pop();
        if(stack.isEmpty()){
            return result;
        }else {
            int last = getAndRemoveLastElement(stack);
            stack.push(last);
            return last;
        }
    }

    //逆序一个栈
    public static void reverse(Stack<Integer> stack){
        if(stack.isEmpty()){
            return;
        }
        int i = getAndRemoveLastElement(stack);
        reverse(stack);
        stack.push(i);
    }
}