LeetCode | Reorder List

最新推荐文章于 2021-02-24 20:30:40 发布

原创最新推荐文章于 2021-02-24 20:30:40 发布 · 659 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #java #单链表

LeetCode 专栏收录该内容

142 篇文章

订阅专栏

本文介绍了一种将单链表按特定模式重新排列的方法。首先将链表从中点分割成两部分，接着反转后半部分链表，最后交错合并两部分以达到所需的重排序效果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

Given a singly linked list L: L₀→L₁→…→L_n-1→L_n,
reorder it to: L₀→L_n→L₁→L_n-1→L₂→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}.

分析

本题思路如下：首先将题目所给单链表从中间分割为两个单链表，再将后半个单链表反向，最后合并两个单链表即可。

代码

public class ReorderList {
	class ListNode {
		int val;
		ListNode next;

		ListNode(int x) {
			val = x;
			next = null;
		}
	}

	public void reorderList(ListNode head) {
		if (head == null || head.next == null) {
			return;
		}

		// find the second half head
		ListNode fast = head.next;
		ListNode slow = head;
		while (fast != null && fast.next != null) {
			fast = fast.next.next;
			slow = slow.next;
		}

		// reverse the second half
		ListNode p = slow.next;
		slow.next = null; // cut the first half
		ListNode pPre = null;
		ListNode pSuf = p.next;
		while (p != null) {
			pSuf = p.next;
			p.next = pPre;
			pPre = p;
			p = pSuf;
		}

		// combine two halves
		ListNode l1 = head;
		ListNode l2 = pPre;
		while (l1 != null && l2 != null) {
			ListNode l1Next = l1.next;
			ListNode l2Next = l2.next;
			l1.next = l2;
			l2.next = l1Next;
			l1 = l1Next;
			l2 = l2Next;
		}
	}
}