class Solution():
def sortColer(self,nums):
p,q=0,0
k=len(nums)-1
while q<=k:
if p<q and nums[q]==0:
nums[p],nums[q]=nums[q],nums[p]
p+=1
elif nums[q]==2:
nums[k], nums[q] = nums[q], nums[k]
k-= 1
else:
q+=1
75.sortColor(python)
最新推荐文章于 2024-08-06 17:50:14 发布