链表实现快排中的Partion比数组简单。
思路是借助两个头指针left和right,比target小的挂在left上,比target大的挂在right上。最后在将两部分接起来。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* partition(ListNode* head, int x) {
auto leftHead = new ListNode(-1);
auto left = leftHead;
auto rightHead = new ListNode(-1);
auto right = rightHead;
auto cur = head;
while(cur!=nullptr){
if(cur->val<x){
left->next = cur;
left = cur;
}else{
right->next = cur;
right = cur;
}
cur = cur->next;
}
left->next = rightHead->next;
right->next = NULL;
return leftHead->next;
}
};