【题目描述】

AcWing 17. 从尾到头打印链表

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] printListReversingly(ListNode head) {
        //计算链表的长度从而确定数组的长度
        ListNode  h = head;
        int len = 0;
        while(h != null){
            len ++;
            h = h.next;
        }
        //按数组从尾到头的顺序填入数组
        int a[] = new int[len];
        while(head != null){
            a[--len] = head.val;
            head = head.next;

        }
        return a;

    }
}