75. Sort Colors python

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未排序的list，然后给出排序结果，要求不能调用包，而且只遍历一次list

思路：有点像快排，两边两个指针，遍历i=0，如果nums[i]==2，就和最后一个指针替换，最后一个指针减一，如果nums[i]==0，就和第一个指针替换，第一个指针加一，i+1，如果nums[i]==1，i+1

class Solution(object):
    def sortColors(self, nums):
        """
        :type nums: List[int]
        :rtype: None Do not return anything, modify nums in-place instead.
        """
        if(nums==[]):return
        start=0
        end=len(nums)-1
        i=0
        while(i<=end):
            if(nums[i]==2):
                nums[i],nums[end]=nums[end],nums[i]
                end-=1
            elif(nums[i]==0):
                nums[i],nums[start]=nums[start],nums[i]
                start+=1
                i+=1
            else:
                i+=1