Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-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}.
分析:
题目规定要 in-place,也就是说只能使用 O(1) 的空间。 可以找到中间节点,断开,把后半截单链表 reverse 一下,再合并两个单链表。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void reorderList(ListNode* head) {
if (head == NULL || head->next == NULL)
return ;
ListNode *fast = head, *slow = head, *prev = NULL;
while (fast && fast->next) {
prev = slow;
slow = slow->next;
fast = fast->next->next;
}
prev->next = NULL; // cut at middle
slow = reverse(slow);
// merge two lists
ListNode *cur = head;
while (cur->next) {
ListNode *tmp = cur->next;
cur->next = slow;
slow = slow->next;
cur->next->next = tmp;
cur = tmp;
}
cur->next = slow;
}
ListNode *reverse(ListNode *head) {
if (head == NULL || head->next == NULL)
return head;
ListNode *prev = head;
for (ListNode *cur = head->next, *next = cur->next; cur;
prev = cur, cur = next, next = next ? next->next : NULL)
cur->next = prev;
head->next = NULL;
return prev;
}
};