题目:
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of the two partitions.
For example,
Given 1->4->3->2->5->2
and x = 3,
return 1->2->2->4->3->5
.
思路:先按照x将链表分割为两个子链表,然后再连接。
class Solution {
public:
ListNode *partition(ListNode *head, int x) {
if (head == nullptr) return head;
ListNode head_small(0);
ListNode head_large(0);
ListNode* tail_small = &head_small;
ListNode* tail_large = &head_large;
ListNode* runner = head;
while (runner != nullptr) {
if (runner->val < x) {
tail_small->next = runner;
tail_small = tail_small->next;
} else {
tail_large->next = runner;
tail_large = tail_large->next;
}
runner = runner->next;
}
// cut the tail
tail_large->next = nullptr;
// concat the two list
tail_small->next = head_large.next;
return head_small.next;
}
};
总结:复杂度为O(n).