1.輸入一個(gè)鏈表舔示，按鏈表從尾到頭的順序返回一個(gè)ArrayList锥腻。
import java.util.ArrayList;
import java.util.Stack;
/**
* @ClassName PrintListFromTailToHead
* @Description
* @Version V1.0
**/
public class PrintListFromTailToHead {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
Stack<Integer> stack = new Stack<>();
ArrayList<Integer> arrayList = new ArrayList<>(16);
//采用棧的先進(jìn)后出
while (listNode!=null){
stack.push(listNode.val);
listNode=listNode.next;
}
while (!stack.isEmpty()){
arrayList.add(stack.pop());
}
return arrayList;
}
class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
}
