[leetcode] 75. Sort Colors

Description

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?

Analysis

low表示为0的下标，从下标0开始；high表示为1的下标，从下标nums.size()-1开始。用i进行迭代，如果nums[i]为0，则将nums[i]与nums[low]交换；如果nums[i]为2，则与nums[high]交换。这样依次遍历所有元素，直到i==high。最终将所有0交换到最前面，所有2交换到最后面，所有1就留在中间了。

Code

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