从尾到头打印链表

/**
*    public class ListNode {
*        int val;
*        ListNode next = null;
*
*        ListNode(int val) {
*            this.val = val;
*        }
*    }
*
*/
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {

ArrayList<Integer> results = new ArrayList<>();

while (listNode!= null){
//从尾到头
results.add(0,listNode.val);
listNode = listNode.next;
}

return results;
}
}