"Leetcode" "Python" Sort Colors

Given an array with n objects colored red, white or blue, sort them so, objects of the same color is Adjacen T, with the colors in the order red, white and blue.

Here, we'll use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.

Note:
You is not a suppose to use the library's sort function for this problem.

Click to show follow up.

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?

Asked to traverse over and use a limited space, I think for a long time it takes two times to traverse or extra space, see a very concise idea of the code, feel good to share to everyone. But this code also has the disadvantage, is similar to the insertion sort, needs to move the large number of elements the position, the time complexity is also quite high.

Class solution:    # @param a a list of integers    # @return Nothing, sort in place    def sortcolors (self, A):        i= J=k=-1        N=len (A) for        m in range (n):            if a[m]==0:                k=k+1                a[k]=2                j=j+1 a[j]=1 i=i+1                a[i]=0            elif a[m]==1:                k=k+1                a[k]=2                j=j+1                a[j]=1            else:                k=k+1                a[k]=2

"Leetcode" "Python" Sort Colors