剑指 Offer 06. 从尾到头打印链表

1. Question

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

2. Examples

示例 1:

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

3. Constraints

  • 0 <= 链表长度 <= 10000

4. References

来源:力扣(LeetCode) 链接:https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。

5. Solutions

利用栈的特性。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
  public int[] reversePrint(ListNode head) {
    Deque<Integer> stack = new LinkedList<>();

    while (head != null) {
      stack.push(head.val);
      head = head.next;
    }

    int[] ans = new int[stack.size()];

    for(int i = 0; i < ans.length; i++) {
      ans[i] = stack.pop();
    }

    return ans;
  }
}
Copyright © rootwhois.cn 2021-2022 all right reserved,powered by GitbookFile Modify: 2022-05-18 16:24:00

results matching ""

    No results matching ""