输入一个链表,从尾到头打印链表每个节点的值
/**
* public class ListNode {
* int val;
* ListNode next = null;
*
* ListNode(int val) {
* this.val = val;
* }
* }
*
*/
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
ArrayList<Integer> list = new ArrayList<Integer>();
reverse(list, listNode);
return list;
}
public void reverse(ArrayList<Integer> list, ListNode node){
if(node == null) return;
if(node.next != null){
reverse(list, node.next);
}
list.add(node.val);
}
}