数组_leetcode75

#coding=utf-8
# 解题思路： 三路排序法（借鉴快速排序的思想）  20190302 找工作期间

class Solution(object):
    def sortColors(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """

        if not nums:
            return None

        zero = -1
        two = len(nums)
        i = 0
        while i < two :
            if nums[i] == 0:
                pass
                nums[zero+1],nums[i] = nums[i],nums[zero+1]
                zero +=1
                i += 1
            elif nums[i] == 1:
                pass
                i += 1

            else:
                pass
                nums[two-1],nums[i] = nums[i],nums[two-1]
                two = two -1


nums = [2,0,2,1,1,0]
nums2 = [1,2,0]
s = Solution()
s.sortColors(nums)
print nums