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?

解题时，先定义两个指针red和blue，初始时red指向下标0，blue指向数组最后一位。然后再建立一个index从下标0开始循环数组的每一个数字。如果当前数字是0，那么交换当前下标与red指针指向的数字，red指针加一。此时能够保证red指针之前的数字都是0。

若当前数字是2，我们交换当前下标与blue指针指向的数字，然后blue下标减一，此时能够保证blue下标后面的数字都是2。这里需要注意一点，交换后，当前下标index值可能会变为0，1，2三种情况，因此我们还需要再次判断一下当前index，即需要index减一。

若当前数字是1，两个指针下标不变，index加一继续向后循环即可。

class Solution {
    public void sortColors(int[] nums) {
        int red = 0;
        int blue = nums.length-1;
        
        for(int i = 0; i<=blue;i++){
            if(nums[i] == 0){
                nums[i] = nums[red];
                nums[red] = 0;
                red++;
            }
            
            else if(nums[i] == 2){
                nums[i] = nums[blue];
                nums[blue] = 2;
                blue--;
                i--;//因为交换后 数字可能为 0 1 2， 所以需要在交换一次；
            }
        }
        
        
        
    }
}