题目描述
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.
分析
又是一道链表重排序问题,如果不要求空间复杂度,则非常容易,但一般在面试中都是要求
O
(
n
)
O(n)
O(n)的时间复杂度,
O
(
1
)
O(1)
O(1)的空间复杂度。可以这样做:
1)将链表从中间拆开,拆成前后两个链表(如果链表长为奇数,可长短后短);
2)将第二个链表反转(参见LeetCode 206);
3)将第二个链表节点逐个插入到第一个链表当中;
code
class Solution {
public:
void reorderList(ListNode* head) {
if (head == NULL || head->next == NULL) {
return;
}
ListNode *fast = head, *slow = head; //快慢指针,快的走两步,慢的走一步,最终慢的指向中间
while (fast->next&&fast->next->next) {
fast = fast->next->next;
slow = slow->next;
}
ListNode *first = head, *second = slow->next;
slow->next = NULL; //分为两个链表 first和second
//反转第二个链表
ListNode *cur=second, *pre=NULL, *next=cur->next;
while (cur) {
cur->next = pre;
if (next == NULL) {
second = cur;
break;
}
pre = cur;
cur = next;
next = next->next;
}
//逐个插入
head = first;
ListNode *tmp;
while (second != NULL) {
tmp = first->next;
first->next = second;
second = second->next;
first->next->next = tmp;
first = first->next->next;
}
}
};
注:如果不要求空间复杂度,则可以无需事先将链表分为两段,只需将所有节点指针存入一个vector就行;分成两段做,也可以不用反转链表,只需将后半段压入栈中,再一个个出栈插入就好。