2021-06-29重排列表

/**
 * 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)
            return;
        List<ListNode> list=new ArrayList<>();
        while(head!=null){
            list.add(head);
            head=head.next;
        }
        int i=0,j=list.size()-1;
        while(i<j){
            list.get(i).next=list.get(j);
            i++;
            if(i==j)
                break;
            list.get(j).next=list.get(i);
            j--;
        }
        list.get(i).next=null;
    }
}