题解 | #重排链表#

/**

• Definition for singly-linked list.

• class ListNode {

• int val;
  

• ListNode next;
  

• ListNode(int x) {
  

•     val = x;
  

•     next = null;
  

• }
  

• } / import java.util.; public class Solution { public void reorderList(ListNode head) { if(head == null || head.next == null || head.next.next == null) return; List list = new ArrayList<>(); ListNode current = head; while (current != null) { list.add(current.val); current = current.next; } if(list.size()==1){

   }
   current = head;
   int i = 0;
   while (current != null) {
       current.val = list.get(i);
       current = current.next;
       if(current!=null){
           current.val = list.get(list.size() - 1 - i);
           current = current.next;
       }
       i++;
   }
  

  } }