【简单递归】之逆序栈

神~经病！
翻来翻去

package com.stack;

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

/*
 * 用递归逆序栈*/
public class RecStack {
	public static void main(String[] args) {
		Stack<Integer> stack = new Stack<>();
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		for (int i = 0; i < n; i++) {
			int num = scanner.nextInt();
			stack.push(num);
		}
		reverse(stack);
		printf(stack);
		scanner.close();
	}

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

//反转
	public static void reverse(Stack<Integer> stack) {
		if (stack.isEmpty()) {
			return;
		}
		int i = getAndRemoveLast(stack);
		reverse(stack);
		stack.push(i);
	}

	// 自底向上打印
	public static void printf(Stack<Integer> stack) {
		if (stack.isEmpty()) {
			return;
		}
		int top = stack.pop();
		printf(stack);
		System.out.println(top + " ");
	}

}