Given a singly linked list L: L 0→L 1→…→L n-1→L n,
reorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→…
You must do this in-place without altering the nodes' values.
For example,
Given{1,2,3,4}, reorder it to{1,4,2,3}.
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public void reorderList(ListNode head) {
if(head == null || head.next == null || head.next.next == null){
return ;
}
ListNode fast = head;
ListNode slow = head;
//使用快慢指针获取链表的中间节点
while(fast != null && fast.next != null && fast.next.next != null){
slow = slow.next;
fast = fast.next.next;
}
//找到了链表的中间节点,快指针归为头指针
fast = head;
while(fast != slow){
//找到要插入的节点(从后往前插入节点)
//要插入的节点
ListNode node = slow.next;
ListNode node_before = slow;
while(node.next != null){
node_before = node;
node = node.next;
}
//修改插入之后的节点指向
node_before.next=node.next;
node.next = fast.next;
ListNode fast_before =fast;
//快指针后移,修改快指针的指向x
fast = fast.next;
//修改指向
fast_before.next =node;
}
return;
}
}