Leetcode_Sort --75. Sort Colors [medium]

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.
给定一个数组有n个元素，他们分别被涂上红、白、蓝三种颜色。将他们排序使具有相同颜色的元素彼此相连
这里我们用整数0，1，2分别代表红、白、蓝三色

Note: You are not suppose to use the library’s sort function for this problem.
注意： 不能使用sort库函数对这个问题进行操作

Example:

Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]

Follow up:
1、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.
2、Could you come up with a one-pass algorithm using only constant space?

Solution：

Python

class Solution:

    def swap(self,a,b,nums):
        temp = nums[a]
        nums[a] = nums[b]
        nums[b] = temp 

    def sortColors(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        '''
        r，i，b为三个指针，i用来遍历整个数组
        r的左侧全为0，b的右侧全为2
        r的左侧和b的右侧都是排好序的，所以判断条件为 i<=b
        我们只需判断元素是否为0或者2，1的话不动作
        '''
        r = 0
        i = 0
        b = len(nums)-1
        while i <= b:
            if nums[i] == 0:
                self.swap(r,i,nums)
                r += 1 # r所指的元素未知，需要等待i指针判断，但r左侧全为0
            elif nums[i] ==2:
                self.swap(i,b,nums)
                b -= 1 # b指针向左移动一位，其所指的值未知，需要判断，但其右侧全为2
                i -= 1 # 交换之后的值需要判断，保持i指针位置不变
            i += 1