從尾到頭打印鏈表
題目描述
/**
* public class ListNode {
* int val;
* ListNode next = null;
*
* ListNode(int val) {
* this.val = val;
* }
* }
*
*/
import java.util.ArrayList;
import java.util.Stack;
public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
ArrayList<Integer> arrayList = new ArrayList<Integer>();
Stack st = new Stack();
while(listNode!=null){
st.push(listNode.val);
listNode = listNode.next;
}
while(!st.empty()){
arrayList.add((Integer)st.pop());
}
return arrayList;
}
}