Leetcode75-颜色分类

代码:
class Solution:
def sortColors(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
left = 0
right = 1
for left in range(len(nums)):
for right in range(left+1, len(nums)):
if nums[left] > nums[right]:
nums[left], nums[right] = nums[right], nums[left]
class Solution:
def sortColors(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
#双指针
if len(nums) == 1:
return nums
left = 0
right = 0
while left < len(nums):
right = left + 1
while right < len(nums):
if nums[left] > nums[right]:
nums[left], nums[right] = nums[right], nums[left]
right += 1
left += 1
版权声明:本文为weixin_43514766原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。