给出一个链表,并将链表的值以倒序存储到数组中。
样例
样例1
输入: 1 -> 2 -> 3 -> null
输出: [3,2,1]
public List<Integer> reverseStore(ListNode head) {
// write your code here
List list = new ArrayList();
if(head==null) {
return list;
}
reverseList(head,list);
return list;
}
public void reverseList(ListNode head,List list){
if(head.next!=null) {
reverseList(head.next,list);
}
list.add(head.val);
}