用递归逆序栈

题目地址：用递归函数和栈逆序一个栈

import java.util.Scanner;
import java.util.Stack;

public class Main {

    private static int getAndPopStackBottom(Stack<Integer> stack) {

        Integer top = stack.pop();

        if (stack.isEmpty()) {
            return top;
        }

        int bottom = getAndPopStackBottom(stack);

        stack.push(top);

        return bottom;

    }

    private static void reverseStack(Stack<Integer> stack) {

        if (stack.isEmpty()) {
            return;
        }

        int bottom = getAndPopStackBottom(stack);

        reverseStack(stack);

        stack.push(bottom);

    }

    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);

        while (in.hasNext()) {

            int n = in.nextInt();

            int[] tmpArr = new int[n];

            for (int i = 0; i < n; ++ i) {
                tmpArr[i] = in.nextInt();
            }

            Stack<Integer> rawStack = new Stack<>();

            for (int i = n - 1; i >= 0; i --) {
                rawStack.push(tmpArr[i]);
            }

            reverseStack(rawStack);

            System.out.print(rawStack.pop());
            for (int i = 1; i < n; ++ i) {
                System.out.print(" " + rawStack.pop());
            }
            System.out.println();
        }

    }
}

用递归逆序栈

原文：https://blog.51cto.com/tianyiya/2530941