LeetCode No.75 Sort Colors

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.

====================================================================================
题目链接：https://leetcode.com/problems/sort-colors/
题目大意：给给定数组进行排序，其中数组中只有0,1,2。
思路：遍历数组，用count0，count1分别记录0和1的个数，最后根据count0和count1对数组进行赋值，时间复杂度为O(N)，空间复杂度为O(1)。
附上代码：

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int count0 = 0 , count1 = 0 , count2 = 0 ;
        int n = nums.size() ;
        for ( int i = 0 ; i < n; i ++ )
        {
            if ( nums[i] == 0 )
                count0 ++ ;
            else if ( nums[i] == 1 )
                count1 ++ ;
        }
        int i = 0 ;
        for ( ; i < count0 ; i ++ )
            nums[i] = 0 ;
        for ( ; i < count1 + count0 ; i ++ )
            nums[i] = 1 ;
        for ( ; i < n ; i ++ )
            nums[i] = 2 ;
    }
};