[leetcode]Sort Colors

标签：represent   nothing   function   library   counter   

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.

class Solution:
    # @param A a list of integers
    # @return nothing, sort in place
    def sortColors(self, A):
        counter=[0,0,0]
        for each in A:
            counter[each]=counter[each]+1
        index_1=counter[0]
        index_2=counter[0]+counter[1]
        for i in range(0,index_1):
            A[i]=0
        for j in range(index_1,index_2):
            A[j]=1
        for k in range(index_2,index_2+counter[2]):
            A[k]=2

[leetcode]Sort Colors

标签：represent   nothing   function   library   counter   

原文地址：http://lichunyu.blog.51cto.com/8160154/1584673