LeetCode—sort-colors（颜色012排序）—java

题目描述：

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的位置，一个右边记录2的位置

代码：

public class Solution {
    public void sortColors(int[] A) {
        int left =0;
        int right = A.length-1;
        int i=0;
        while(i<=right){
            if(A[i]==0){
                swap(A,i++,left++);
            }else if(A[i]==2)
                swap(A,i,right--);
            else
                i++;
        }
    }
    public void swap(int[] A,int i,int j){
        int temp=A[i];
        A[i]=A[j];
        A[j]=temp;
    }
}

参考：https://blog.csdn.net/gesanghuakaisunshine/article/details/79395529