75. Sort Colors(Python3)

75. Sort Colors(Python3)

题目

Given an array with n objects colored red, white or blue, sort them 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.

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 an one-pass algorithm using only constant space?

解题方案

思路：

• 定义一个left，一个right
• 遇到1，left++
• 遇到2，和right位置换，right–
• 遇到0，往前和第一个非零数字换，left++

代码：

class Solution:
    def sortColors(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        if not nums:
            return
        left = 0
        right = len(nums) - 1
        while left <= right:
            if nums[left] == 0:
                for i in range(left):
                    if nums[i] != 0:
                        nums[left],nums[i] = nums[i],nums[left]
                        break
                left += 1
            elif nums[left] == 1:
                left += 1
            elif nums[left] == 2:
                nums[left],nums[right] = nums[right],nums[left]
                right -= 1