题解 | 剑指offer |#从尾到头打印链表#

import java.util.*;
/**
*    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> array = new ArrayList<>();
        ListNode currentNode = listNode;
        for(int i = 0; currentNode != null; i ++){
            array.add(currentNode.val);
            currentNode = currentNode.next;
            //System.out.println(array[i]);
        }
        
        ArrayList<Integer> array_reverse = new ArrayList<>();
        for(int i = array.size() - 1; i >= 0; i --){
            array_reverse.add(array.get(i));
        }
        return array_reverse;
    }
}