劍指Offer學習-面試題6:從尾到頭打印鏈表

	/**
     * 從尾到頭打印鏈表
     *
     * @param root
     * @return
     */
    public void printListRevers(ListNode root) {
        Stack<Integer> stack = new Stack<>();
        ListNode head = root;
        while (null != head) {
            stack.add(head.val);
            head = head.next;
        }
        while (!stack.isEmpty())
            System.out.println(stack.pop());
    }

    /**
     * 遞歸實現
     *
     * @param root
     */
    public void printListRevers2(ListNode root) {
        if (null != root) {
            if (null != root.next) printListRevers2(root.next);
            System.out.println(root.val);
        }
    }