给定一个单链表 L 的头节点 head ,单链表 L 表示为:
L0 → L1 → … → Ln-1 → Ln
请将其重新排列后变为:
L0 → Ln → L1 → Ln-1 → L2 → Ln-2 → …
不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/LGjMqU
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public void reorderList(ListNode head) {
//找到中间节点
ListNode temp = head;
ListNode aux = new ListNode(-1);
aux.next = head;
ListNode slow = aux;
ListNode fast = aux;
while(fast != null && fast.next != null){
fast = fast.next.next;
slow = slow.next;
}
//将链表从中间断开
ListNode head2 = slow.next;
slow.next = null;
//把后半段链表反转
ListNode temp2 = null;
ListNode cur = head2;
ListNode pre = null;
ListNode next = null;
while(cur != null){
next = cur.next;
cur.next = pre;
pre = cur;
cur = next;
}
head2 = pre;
//将反转后的后半段链表插入前半段链表
temp = head;
while(temp != null && head2 != null){
temp2 = head2;
head2 = head2.next;
temp2.next = temp.next;
temp.next = temp2;
temp = temp.next.next;
}
}
}