leetcode Sort Colors题解

题目描述：

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，三个元素，不适用已有的排序函数库将数组排序。

解题思路：

使用含有三个元素的count数组对0,1,2三个元素进行计数，然后根据数量将0,1,2依次放入原始数组中。

代码（java）：

class Solution {
    public void sortColors(int[] nums) {
        int[] count=new int[3];
        for(int val:nums){
            count[val]++;
        }
        int k=0;
        for(int i=0;i<3;i++){
            for(int j=0;j<count[i];j++){
                nums[k++]=i;
            }
        }
    }
}