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

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) {
        ListNode pre = null;
        ListNode curr = listNode;
        ListNode tmp = null;
        while(curr != null){
            tmp = curr.next;
            curr.next = pre;
            pre = curr;
            curr = tmp;
        }

        ArrayList<Integer> res = new ArrayList<>();
        while(pre != null){
            res.add(pre.val);
            pre = pre.next;
        }
        return res;
    }
}