【LeetCode】面试题06. 从尾到头打印链表（JAVA）

原题地址：https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/

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

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

限制：

0 <= 链表长度 <= 10000

代码：

直接法：

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

栈：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] reversePrint(ListNode head) {
        Stack<Integer> s = new Stack<>();
        int count = 0;
        while(head != null)
        {
            s.push(head.val);
            count ++;
            head = head.next;
        }
        int[] res = new int[count];
        for(int i = 0; i < count; i ++)
            res[i] = s.pop();
        return res;
    }
}

递归：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] reversePrint(ListNode head) {
        List<Integer> num = new ArrayList<>();
        recur(head, num);
        int[] res = new int[num.size()];
        for(int i = 0; i < res.length; i ++)
            res[i] = num.get(i);
        return res;
    }

    public void recur(ListNode head, List<Integer> num)
    {
        if(head == null) return;
        if(head.next == null)
            num.add(head.val);
        else
        {
            recur(head.next, num);
            num.add(head.val);
        }  
    }
}