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

我的思路就是首先将整个链表反转，然后再将链表打印出来。
/**

• public class ListNode {

• int val;

• ListNode next = null;

• ListNode(int val) {

• this.val = val;

• }

• }

• /
  import java.util.ArrayList;
  public class Solution {
  public ArrayList<integer> printListFromTailToHead(ListNode listNode) {</integer>

     ListNode pre = null;
     ListNode next = null;
     ArrayList<Integer> list = new ArrayList<Integer>();
     while(listNode != null){
         next = listNode.next;
         listNode.next = pre;
         pre = listNode;
         listNode = next;
     }
  
     while(pre != null){
         list.add(pre.val);
         pre = pre.next;
     }
     return list;

  }
  }