从尾到头打印链表

import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        ArrayList<Integer> arr = new ArrayList<>();
        if(listNode == null){
            return arr;
        }
        arr.add(listNode.val);
        while(listNode.next!=null){
            listNode = listNode.next;
            arr.add(listNode.val);
        }
        
        int i = 0;
        int j = arr.size()-1;
        for(;i<=j;i++,j--){
            int temp = arr.get(i);
        	arr.set(i, arr.get(j));
        	arr.set(j, temp);
        }
        return arr;
    }
}