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.

click to show follow up.

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?

题的意思是对一个包含0,1,2三种数字的数组重新排序，使得排好序的数组前一段都是0，中间一段都是1，最后一段都是2。

第一种方法：扫描两遍，第一遍记录每个颜色出现的个数，第二遍根据每个颜色的个数对数组重新赋值

public class Solution {
    public void sortColors(int[] nums) {
        int r,w,b;
        r = w = b = 0;
        //第一遍扫描，记录每个颜色的个数
        for (int i = 0; i < nums.length; i++) {
			if (nums[i] == 0) {
				r++;
			}else if (nums[i] == 1) {
				w++;
			}else {
				b++;
			}
			
		}
        //第二遍扫描，根据每个颜色的个数给数组中的元素重新赋值
        for (int i = 0; i < nums.length; i++) {
			if (i < r) {
				nums[i] = 0;
			}else if (i < r+w) {
				nums[i] = 1;
			}else {
				nums[i] = 2;
			}
		}
    }
}

第二种方法，是只扫描一遍数组。 扫描一遍，单向遍历，当扫描数组的时候，使用首尾两个指针。

public class Solution {
    public void sortColors(int[] nums) {
        int start = 0;
       int end = nums.length;
       for (int i = 0; i < end; i++) {
    		 //把红色放在首部
        	   if (nums[i] == 0) {
    			int temp = nums[start];
    			nums[start] = nums[i];
    			nums[i] = temp;
    			start++;
    			
    		}//把蓝色放在尾部，这样白色自然就在中间
        	 else if (nums[i] == 2) {
        		end--; 
        		int temp = nums[end];
     			nums[end] = nums[i];
     			nums[i] = temp;
     			i--;//后面交换过来的元素也要进行判断
    		}  
		}
		
    }
}