输入一个链表,从尾到头打印链表每个节点的值。
'/**
* 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> list = new ArrayList<Integer>();
Stack<Integer> stack = new Stack<Integer>();
while(listNode!= null){
stack.push(listNode.val);
//if(listNode.next != null){
listNode = listNode.next ;
// }
// else break;
}
for(int i = 0;i <=stack.size()+1;i++){
list.add(stack.pop());
}
return list;
}
}'