方法一:递归:
import java.util.ArrayList;
public class Solution {
public static ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
ArrayList<Integer> list = new ArrayList<Integer>();
return help(listNode, list);
}
public static ArrayList<Integer> help(ListNode listNode, ArrayList<Integer> list){
if(listNode == null) {
return list;
}
help(listNode.next, list);
list.add(listNode.val);
return list;
}
}
方法2:栈:
import java.util.ArrayList;
import java.util.Stack;
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
if(listNode == null) {
return new ArrayList<Integer>();
}
ArrayList<Integer> list = new ArrayList<Integer>();
Stack<Integer> stack = new Stack<Integer>();
while(listNode != null) {
stack.push(listNode.val);
listNode = listNode.next;
}
while(!stack.isEmpty()) {
list.add(stack.pop());
}
return list;
}
}