LeetCode题解：Sort Colors

题目

---

75. Sort Colors
    Medium

1550

148

Favorite

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

题目分析

有三种颜色，分别用0,1,2代替，给定一个数组，将该数组变成0，1，2按序排列的数组，例如[2,0,2,1,1,1]变成[0,0,1,1,2,2]。

解析思路

---

第一种方式是计数排序，需要两次遍历，第一次遍历找出有多少0、多少1、多少2，然后将相应的0、1、2填入数组中。

javascript代码：

/**
 * @param {number[]} nums
 * @return {void} Do not return anything, modify nums in-place instead.
 */
var sortColors = function(nums) {
    var s0=0,s1=0,s2=0;
    for(var i = 0;i < nums.length;i++){
        if(nums[i] == 0) {
            s0++;
        }else if(nums[i] == 1){
            s1++;
        }else{
            s2++;
        }
    }
    for(i = 0;i < s0;i++){
        nums[i] = 0;
    }
    for(;i<s1+s0;i++) nums[i] = 1;
    for(;i<nums.length;i++) nums[i] = 2;
};

第二种解法只需要一次遍历即可，观察得到的数组我们发现，0肯定是在最前面，2肯定是在最后面，所以我们用两个指针，一个指向0的末尾，一个指向2的开始，遍历中遇到0或者2就交换，一旦0和2确定了，那么1也一定确定了。先上代码：

/**
 * @param {number[]} nums
 * @return {void} Do not return anything, modify nums in-place instead.
 */
var sortColors = function(nums) {
    var s0=-1,s2=nums.length;
    for(var i = 0;i < s2;i++){
        if(nums[i] == 0){
            var temp = nums[++s0];
            nums[s0] = nums[i];
            nums[i] = temp;
        }else if(nums[i] == 2){
            var temp = nums[--s2];
            nums[s2] = nums[i];
            nums[i]=temp;
            i--;
        }
    }
};

注意我们在nums[i]==2时将i减去1，这是因为我们将2换到后面的时候，换回来的可能是0，所以换回来的值我们还需要做一次判断。那为什么换0的时候不用呢？因为0是换到前面，前面的值已经遍历过了。