Algorithm
Partition Array According to Given Pivot
Solution
class Solution:
def pivotArray(self, nums, pivot):
less = 0
equal = 0
for num in nums:
if num < pivot:
less += 1
elif num == pivot:
equal += 1
ans = [0] * len(nums)
lessI = 0
equalI = less
greaterI = less + equal
for i in range(len(nums)):
num = nums[i]
if num < pivot:
ans[lessI] = num
lessI += 1
elif num > pivot:
ans[greaterI] = num
greaterI += 1
else:
ans[equalI] = num
equalI += 1
return ansVideo GuideLeetcode Daily
Time Complexity
O(N)
Space Complexity
O(N)
