LeetCode 75. 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?

方法一：

class Solution {
public:
    void sortColors(vector<int>& nums) {
        // 计数排序法 counting sort
        // 时间复杂度: O(n)
        // 空间复杂度: O(1)
        int count[3] = {0};
        
        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<3; i++)
        {
            for (int j=0; j<count[i]; j++)
                nums[index++] = i;
        }
    }
};

方法二：

class Solution {
public:
    void sortColors(vector<int>& nums) {
        // 三路快速排序
        // 时间复杂度: O(n)
        // 空间复杂度: O(1)
        int zero = -1; // nums[0...zero] == 0
        int two = nums.size(); // num[two...n-1] == 2
        
        for (int i=0; i<two; )
        {
            if (nums[i] == 1) i++;
            else if (nums[i] == 2) swap(nums[--two] , nums[i]);
            else 
            {
                assert( nums[i] == 0 );
                swap(nums[++zero] , nums[i++]);
            }
        }
    }
};

方法二相较于方法一，时间复杂度和空间复杂度都没有任何改变，但它只遍历了一遍数组，就实现了对该数组的排序。