给出一个链表，并将链表的值以倒序存储到数组中。

package com.lxg.algorithm;
import java.util.ArrayList;
import java.util.List;
public class Solution05 {
    /**
     * @param head: the given linked list
     * @return: the array that store the values in reverse order
     */
    public static List<Integer> reverseStore(ListNode head) {
        // write your code here
        ArrayList<Integer> list = new ArrayList<>();
        ListNode temp = head;
        while (temp != null){
            list.add(temp.val);
            temp = temp.next;

        }
        ArrayList<Integer> list1 = new ArrayList<>();
        int j = list.size()-1;
        for (int i = 0; i < list.size(); i++) {
            list1.add(i,list.get(j));
            j--;
        }
        System.out.println("list = " + list);
        System.out.println("list1 = " + list1);
        return list1;
    }
}