算法题——剑指Offer：从尾到头打印链表

解决思路：利用栈先进后出的特性，将链表节点从尾到头存到ArrayList里

import java.util.Stack;
import java.util.ArrayList;

Class LinkedListNode {
	int val;
	LinkedListNode next;
	LinkedListNode(int val) {
		this.val = val;
	}
}

public void Solution {
	public ArrayList<Integer> printLinkedListFromTailToHead(LinkedListNode node) {
		Stack<Integer> stack = new Stack<>();
		ArrayList<Integer> list = new ArrayList<>();
		while(list != null) {
			stack.push(list.val);
			node = node.next;
		}
		while(!stack.isEmpty()) {
			list.add(stack.pop());
		}
		return list;
	}
}