Partition Array
Partition Array
Given an arraynums
of integers and an intk
, partition the array (i.e move the elements in "nums") such that:
All elements < k _are moved to the _left
All elements >= k _are moved to the _right
Return the partitioning index, i.e the first index nums[i] >=k.
Example
If nums =[3,2,2,1]
andk=2
, a valid answer is1
.
Note
快速排序的划分过程
返回左指针就行啦
Code
Last updated