输出反转链表

import java.util.ArrayList;import java.util.Stack;public class Solution {    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {        Stack<Integer> integers = new Stack<>();        while (listNode != null) {            integers.push(listNode.val);            listNode = listNode.next;        }        ArrayList<Integer> arrayList = new ArrayList<>();        while (!integers.isEmpty()){            arrayList.add(integers.pop());        }        return arrayList;    }//    public static void main(String[] args) {//        Solution solution= new Solution();//        ListNode listNode = new ListNode(1);//        ListNode listNode1 =new ListNode(2);//        ListNode listNode2 = new ListNode(3);//        listNode.next = listNode1;//        listNode1.next = listNode2;//        //listNode.next = (new ListNode(2).next = new ListNode(3));//        System.out.println(solution.printListFromTailToHead(listNode));//    }}//class ListNode {//        int val;//        ListNode next = null;//        ListNode(int val) {this.val = val;//    }//}