import java.util.ArrayList;
import java.util.Stack;
//利用栈“先进后出”的特点
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
Stack<Integer> stack=new Stack<Integer>();
while(listNode != null){
stack.push(listNode.val);
listNode=listNode.next;
}
ArrayList<Integer> vals=new ArrayList<Integer>();
while(!stack.isEmpty()){
vals.add(stack.pop());
}
return vals;
}
}
import java.util.Stack;
//利用栈“先进后出”的特点
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
Stack<Integer> stack=new Stack<Integer>();
while(listNode != null){
stack.push(listNode.val);
listNode=listNode.next;
}
ArrayList<Integer> vals=new ArrayList<Integer>();
while(!stack.isEmpty()){
vals.add(stack.pop());
}
return vals;
}
}