作者:~小明学编程
文章专栏:每日一练——Java
格言:目之所及皆为回忆,心之所想皆为过往
重排链表
链接
题目描述
给定一个单链表 L 的头节点 head ,单链表 L 表示为:
L0 → L1 → … → Ln - 1 → Ln
请将其重新排列后变为:
L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → …
不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public void reorderList(ListNode head) {
if(head==null||head.next==null) {
return;
}
ListNode slow = head;
ListNode fast = head;
ListNode cur = head;
while(fast!=null&&fast.next!=null) {
slow = slow.next;
fast = fast.next.next;
}
ListNode mid = slow;
//定义一个前驱节点用于反转链表的后半段
ListNode prev = null;
ListNode slowNext = null;
while(slow!=null) {
slowNext = slow.next;
slow.next = prev;
prev = slow;
slow = slowNext;
}
ListNode newList = new ListNode(-1);
ListNode curNewList = newList;
while(cur!=null) {
curNewList.next = cur;
cur = cur.next;
curNewList = curNewList.next;
if(prev!=mid) {
curNewList.next = prev;
prev = prev.next;
curNewList = curNewList.next;
}
}
head = newList.next;
}
}