75. Sort Colors Medium
Description
Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
Note: You are not suppose to use the library’s sort function for this problem.
Example
Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]
Follow up:
- A rather straight forward solution is a two-pass algorithm using counting sort.
First, iterate the array counting number of 0’s, 1’s, and 2’s, then overwrite array with total number of 0’s, then 1’s and followed by 2’s. - Could you come up with a one-pass algorithm using only constant space?
题意
将0,1,2分别代表红色,白色,蓝色的数组按照红白蓝排序。
要求最好不要用遍历一遍分别0,1,2计数然后覆盖的方法。
解题思路
遍历数组,值为0往前放,值为2往后放,那么1自然集合到中间。
code
class Solution:
def sortColors(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
left , right = 0, len(nums) -1
i = 0
while i <= right:
if nums[i] == 0:
temp = nums[i]
nums[i] = nums[left]
nums[left] = temp
left += 1
i += 1
elif nums[i] == 2:
temp = nums[i]
nums[i] = nums[right]
nums[right] = temp
right -= 1
else:
i += 1