import java.util.ArrayList;
import java.util.Stack;
public class Solution {
public ArrayList<Integer>printListFromTailToHead(ListNode listNode) {
ArrayList<Integer> arrayList = new ArrayList<Integer>();
Stack<Integer> stack = new Stack<Integer>();
while (listNode != null) {
stack.add(listNode.val);
listNode = listNode.next;
}
while (!stack.isEmpty()) {
arrayList.add(stack.pop());
}
return arrayList;
}
}
倒序一定要首先想到栈!