LeetCode算法题目：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.

---

分析：

不能库函数而且函数无返回值即是要在原数组内进行处理。
可以按题目提示的Follow up的思路进行处理——统计原数组中0，1，2的个数，然后清空数组，分别把这三个数依次写进数组内。

---

代码：

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int size = nums.size();
        int num[3] = {0};
        for(int i=0;i<size;i++) {
            if(nums[i] == 0)
                num[0]++;
            else if(nums[i] == 1)
                num[1]++;
            else
                num[2]++;
        }
        nums.clear();
        for(int j=0;j<3;j++) {
            for(int k=0;k<num[j];k++) {
                nums.push_back(j);
            }
        }
    }
};