/**
* public class ListNode {
* int val;
* ListNode next = null;
*
* ListNode(int val) {
* this.val = val;
* }
* }
*
*/
import java.util.ArrayList;
import java.util.Stack;
public class Solution {
//用递归或者栈实现
public ArrayList printListFromTailToHead(ListNode listNode) {
Stack stack=new Stack();
while(listNode!=null){
stack.push(listNode.val);
listNode=listNode.next;
}
ArrayList list=new ArrayList();
while(!stack.isEmpty()){
list.add(stack.pop());
}
return list;
}
}