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

如有侵权，请联系删除，本人只想记录题目，若有冒犯，请谅解！

问题描述：

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

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

方法一：不借助栈（K神方法）

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

    public void recurrent(ListNode head){
        if(head == null){
            return;
        }
        recurrent(head.next);
        list.add(head.val);
    }
}

方法二：借助栈，使用LinkedList（K神方法）

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    List<Integer> list = new ArrayList<>();
    public int[] reversePrint(ListNode head) {
       LinkedList<Integer> stack = new LinkedList<>();
       while (head != null){
           stack.addLast(head.val);
           head=head.next;
       }
       int[] res = new int[stack.size()];
       for(int i = 0;i<res.length;i++){
           res[i] = stack.removeLast();
       }
       return res;
    }

}

方法三：借助栈，使用Stack（官方方法）

/**
 * 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> stack = new Stack<>();
        ListNode temp = head;
        while(temp != null){
            stack.push(temp);
            temp = temp.next;
        }
        int size = stack.size();
        int[] print = new int[size];

        for(int i = 0; i< size;i++){
            print[i] = stack.pop().val;
        }
        return print;
    }
}