#2161
Partition Array According to Given Pivot
pupil · 365 · lc medium +23 · verified · 89.8% accepted · 1,762 likes · top 99%
Description
You are given a 0-indexed integer array nums and an integer pivot. Rearrange nums so that:
- All elements less than pivot appear before all elements greater than pivot.
- All elements equal to pivot appear between the lesser and greater elements.
- Elements smaller than pivot retain their relative order, and so do elements larger than pivot.
- More formally, if pi and pj are the new positions of elements originally at indices i < j, and both are smaller (or both larger) than pivot, then pi < pj.
Return nums after the rearrangement.
Example 1:
Input: nums = [9,12,5,10,14,3,10], pivot = 10
Output: [9,5,3,10,10,12,14]
Explanation:
The elements 9, 5, and 3 are less than the pivot so they are on the left side of the array.
The elements 12 and 14 are greater than the pivot so they are on the right side of the array.
The relative ordering of the elements less than and greater than pivot is also maintained. [9, 5, 3] and [12, 14] are the respective orderings.
Example 2:
Input: nums = [-3,4,3,2], pivot = 2
Output: [-3,2,4,3]
Explanation:
The element -3 is less than the pivot so it is on the left side of the array.
The elements 4 and 3 are greater than the pivot so they are on the right side of the array.
The relative ordering of the elements less than and greater than pivot is also maintained. [-3] and [4, 3] are the respective orderings.
Code
1
2
3