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}
.
分析:使用快慢指针将链表切断,后半部入栈,出栈插入前半部。感觉效率不高,应该有更高效的方式。
/**
* 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 || !head->next) return;
ListNode *slow = head;
ListNode *fast = head->next;
//找到中间节点
while( fast && fast->next ) {
fast = fast->next->next;
slow = slow->next;
}
//后半部入栈
stack<ListNode *> st;
ListNode *p = slow->next;
slow->next = NULL;
while(p) {
st.push(p);
p = p->next;
}
//出栈插入前半部
ListNode *pre = head;
ListNode *cur = NULL;
while( !st.empty() ) {
cur = st.top();
st.pop();
cur->next = pre->next;
pre->next = cur;
pre = cur->next;
}
}
};
同时快慢指针寻找中间节点,还可以这样:
ListNode *slow = head;
ListNode *fast = head;
while(fast) {
if(fast) fast = fast->next;
if(fast) fast = fast->next;
if(!fast) break;
slow = slow->next;
}