1
class Solution:
2
def pivotArray(self, nums: List[int], pivot: int) -> List[int]:
3
left = []
4
mid = []
5
right = []
6
for i in nums:
7
if i < pivot:
8
left.append(i)
9
elif i == pivot:
10
mid.append(i)
11
else:
12
right.append(i)
13
return left + mid + right

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0