public int[] reversePrint(ListNode head) {
if (head == null) return new int[0];
Deque<Integer> stack = new LinkedList<>();
int cnt = 0;
while (head != null){
stack.push(head.val);
head = head.next;
cnt++;
}
int[] res = new int[cnt];
for (int i = 0; i < cnt; i++) {
res[i] = stack.pop();
}
return res;
}
剑指 Offer 06. 从尾到头打印链表(栈)
最新推荐文章于 2024-09-25 11:06:23 发布