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.

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 an one-pass algorithm using only constant space?

如果没有很好的思路的话，可以使用任意一种排序算法，但是没用到题目给出的特殊条件。

思路1：元素个数非常有限的时候可以采用计数排序

class Solution {
public:
       // 时间复杂度：O(n)
       // 空间复杂度：O(1)
       void sortColors(vector<int> &nums)
       {
              int count[3] = { 0 }; // 存放0，1，2三个元素的频率
              for (int i = 0; i < nums.size(); i++)
              {
                     assert(nums[i] >= 0 && nums[i] <= 2);
                     count[nums[i]] ++;
              }
              int index = 0;
              for (int i = 0; i < count[0]; i++)
                     nums[index++] = 0;
              for (int i = 0; i < count[1]; i++)
                     nums[index++] = 1;
              for (int i = 0; i < count[2]; i++)
                     nums[index++] = 2;
       }
};

思路2：三路快速排序

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int zero = -1; 
        int two = nums.size(); 
        // nums[0...zero] == 0, [0, -1]是一个无效的区间，这就说明没有一个元素等于0
        // nums[two...n-1] == 2, [n, n-1]是一个无效空间，这就说明没有一个元素等于2
        for (int i = 0; i < two;)
        {
            if (nums[i] == 1) {
                i++;
            }
            else if (nums[i] == 2) {
                swap(nums[i], nums[--two]);
            }
            else {
                swap(nums[++zero], nums[i++]);
            }
        }
    }
};

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int lt = -1;
        int gt = nums.size();

        int i = 0;
        while (i < gt) {
            if (nums[i] == 1) {
                i++;
            }
            else if (nums[i] == 2) {
                swap(nums[i], nums[--gt]);
            }
            else {
                swap(nums[i++], nums[++lt]);
            }
        }
    }
};

网上的不那么直观的第三种做法

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