题解 | #从尾到头打印链表#

/**

• public class ListNode {

•    int val;
  

•    ListNode next = null;
  

•    ListNode(int val) {
  

•        this.val = val;
  

•    }
  

• }

*/ import java.util.ArrayList; import java.util.Collections; public class Solution { public ArrayList printListFromTailToHead(ListNode listNode) { ArrayList list = new ArrayList<>(); while(listNode!=null){ list.add(listNode.val); listNode = listNode.next; } Collections.reverse(list); return list; } }