LeetCode-06-链表从头到尾打印链表

public int[] reversePrint(ListNode head) { // 注意边界值，数组初始化赋值为0 if (head == null) return new int[0]; int top = -1; int[] list = ne