Problem
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.
Example
Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]
Note:
You are not suppose to use the library’s sort function for this problem.
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?
solution1
对元素进行统计然后构造新的数组
solution2
直接对数组进行排序
solution3
'''
讨论区中大神的方案,很巧妙的思路
初始化: i=j=k=0.
Case 1:2, [0,i) [i,j) don't change [j,k)->[j,k+1)
Case 2: 0, [0, i)-> [0,i+1), [i,j)->[i,j+1), [j, k)->[j+1,k+1)
Case 3: 1: [0,i)不变, [i,j)->[i,j+1), [j,k)->[j+1, k+1)
'''
def sortColors(self, nums):
i = j = 0
for k in xrange(len(nums)):
v = nums[k]
nums[k] = 2
if v < 2:
nums[j] = 1
j += 1
if v == 0:
nums[i] = 0
i += 1