剑指Offer每日一题07

剑指Offer每日一题07

面试题06. 从尾到头打印链表

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

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

**限制：**0 <= 链表长度 <= 10000

方法一：ArrayList

 public int[] reversePrint(ListNode head) {
        ArrayList<Integer> list = new ArrayList<>();
        while (head != null) {      //放到ArrayList里
            list.add(head.val);
            head = head.next;
        }
        int size = list.size();
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {   //倒序取到新数组里
            array[i] = list.get(size - i -1);
        }
        return array;
    }

方法二：栈

public int[] reversePrint(ListNode head) {
        Stack<ListNode> stack = new Stack<ListNode>();
        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;
    }

可以将ListNode替换为能直接保存val的类型Integer

 public int[] reversePrint(ListNode head) {
        Stack<Integer> stack = new Stack<>();
        while (head != null) {
            stack.push(head.val);
            head = head.next;
        }
        int size = stack.size();
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = stack.pop();
        }
        return array;
    }

方法三：递归

class Solution {
ArrayList<Integer> tmp = new ArrayList<Integer>();
    public int[] reversePrint(ListNode head) {
        recur(head);
        int[] res = new int[tmp.size()];          //将tmp里的值放到新数组里
        for(int i = 0; i < res.length; i++)  
            res[i] = tmp.get(i);
        return res;
    }
    void recur(ListNode head) {          //递归
        if(head == null) return;    //走过链表尾部节点时递归终止
        recur(head.next);           //每次传head.next,朝尾节点一直走直到null
        tmp.add(head.val);          //将当前节点值加入temp，倒序返回
    }
}