【LeetCode】 143. Reorder List 重排链表(Medium)(JAVA)
题目地址: https://leetcode.com/problems/reorder-list/
题目描述:
Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You may not modify the values in the list’s nodes, only nodes itself may be changed.
Example 1:
Given 1->2->3->4, reorder it to 1->4->2->3.
Example 2:
Given 1->2->3->4->5, reorder it to 1->5->2->4->3.
题目大意
给定一个单链表 L:L0→L1→…→Ln-1→Ln ,
将其重新排列后变为: L0→Ln→L1→Ln-1→L2→Ln-2→…
你不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
解题方法
- 快慢指针找出中间节点(快指针先走一步,这样找到的中间节点:如果为偶数就是前半部分最后一个,如果为奇数正好是中间节点)
- 中间节点之后的所有元素翻转
- 从头开始遍历一个个元素接起来
class Solution {
public void reorderList(ListNode head) {
if (head == null) return;
ListNode fast = head.next;
ListNode slow = head;
while (fast != null && fast.next != null) {
fast = fast.next.next;
slow = slow.next;
}
ListNode second = slow.next;
slow.next = null;
ListNode rev = null;
while (second != null) {
ListNode next = second.next;
second.next = rev;
rev = second;
second = next;
}
while (head != null && rev != null) {
ListNode next = head.next;
ListNode revNext = rev.next;
head.next = rev;
rev.next = next;
head = next;
rev = revNext;
}
}
}
执行耗时:2 ms,击败了83.64% 的Java用户
内存消耗:41.2 MB,击败了34.87% 的Java用户
![](https://i-blog.csdnimg.cn/blog_migrate/6c56d31f951aece27c5faae608dfac2e.jpeg)