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

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

示例 1：

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

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

        }
        return nums;
   
    }
}**
``

用栈

```java
/**
 * 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<ListNode> st = new Stack<>();
        ListNode node = head;
        while(node != null){
            st.push(node);
            node = node.next;
        }
        int size = st.size();
        int []nums = new int[size];
        for(int i = 0; i < size; i++){
            nums[i] = st.pop().val;
        }
        return nums;
    }
}

/**
 * Definition for singly-linked list.   //超出内存限制
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    ArrayList<Integer> array = new ArrayList<>();
    public int[] reversePrint(ListNode head) {
   
    ListNode node = head;
    reuu(node);

    int [] arr = new int[array.size()];
    for(int i = 0; i < array.size(); i++){
        arr[i] = array.get(i);

    }
    return arr;

    }

    void reuu(ListNode node){
        while(node != null){
            if (node.next != null){
                reuu(node.next);
            }
            array.add(node.val);
        }
        
    }
}