3 从尾到头打印链表

 1 import java.util.ArrayList;
 2 import java.util.Stack;
 3 public class Solution {
 4     public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
 5         Stack<Integer> s=new Stack<Integer>();
 6         for(ListNode l = listNode;l!=null;l=l.next)
 7             s.push(l.val);
 8         ArrayList<Integer> newlist = new ArrayList<Integer>();
 9         while(!s.isEmpty()){
10             newlist.add(s.pop());
11         }
12         return newlist;
13     }