从头到尾打印链表

从尾到头打印链表

输入一个链表，按链表值从尾到头的顺序返回一个ArrayList

/**
*    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> result = new ArrayList<>();
        if(listNode == null){
            return result;
        }
        Stack<Integer> stack = new Stack<>();
        ListNode temp = listNode;
        while(temp!=null){
            stack.push(temp.val);
            temp = temp.next;
        }
        while(!stack.empty()){
            result.add(stack.pop());
        }
        return result;
    }
}