Leetcode Problem 2161. Partition Array According to Given Pivot
Leetcode Solutions
Three-Pass Partitioning
- Initialize three empty lists (or arrays) for elements less than, equal to, and greater than the pivot.
- Iterate through the input array
numsand for each element:- If it is less than
pivot, add it to the 'less than' list. - If it is equal to
pivot, add it to the 'equal to' list. - If it is greater than
pivot, add it to the 'greater than' list.
- If it is less than
- Concatenate the three lists in the order of 'less than', 'equal to', and 'greater than' to form the rearranged array.
- Return the rearranged array.
In-Place Two-Pointer Approach
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...