输入一个链表,按链表值从尾到头的顺序返回一个ArrayList。
package test;
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
package test;
import java.util.ArrayList;
import java.util.Stack;
public class practiceThird {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
ArrayList<Integer> list = new ArrayList<Integer>();
if(listNode == null)
return list;
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;
}
}