打卡系列-剑指 Offer 06. 从尾到头打印链表

输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。

示例 1：

输入：head = [1,3,2]
输出：[2,3,1]

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] reversePrint(ListNode head) {
        ListNode temp = head;
        int i = 0;
        while(temp != null){
            i++;
            temp = temp.next;
        }
        int[] arrInt = new int[i];
        temp = head;
        while(temp != null){
            arrInt[--i] = temp.val;
            temp = temp.next;
        }
        return arrInt;
    }
}

链接:https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/