【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?

1. 解法一

解题思路：

• 第一遍扫描数组，统计数组中的0，1，2的个数；
• 第二遍扫描，将0，1，2赋值到数组中

代码如下：

class Solution {
public:
    void sortColors(vector<int>& nums) {
        vector<int> colorCount(3, 0);
        
        for(int i = 0; i < nums.size(); i++) {
            colorCount[nums[i]]++;
        }
        
        int k = 0;
        for(int i = 0; i < colorCount.size(); i++) {
            for(int j = 0; j < colorCount[i]; j++) {
                nums[k++] = i;
            }
        }
    }
};

2. 解法二

解题思路：

• 利用双指针，red指向数组的开始位置，blue指针指向数组的结束位置。
• 遍历数组
  • 如果当前元素是0，交换当前元素和red指针指向的元素，同时red和遍历下标后移
  • 如果当前元素是1，跳过；
  • 如果当前元素是2，交换当前元素和blue指针指向的元素，同时blue前移（注意此时遍历下标不变，因为换过来的元素可能还需要进一步交换）

代码如下：

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int red = 0, blue = nums.size() - 1;
        int cur = 0;
        
        while(cur <= blue) {
            if(nums[cur] == 0) {
                swap(nums[cur++], nums[red++]);
            } else if (nums[cur] == 2) {
                swap(nums[cur], nums[blue--]);
            } else {
                cur++;
            }       
        }
    }
};