LeetCode-Sort Colors

题目：https://oj.leetcode.com/problems/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?

方法1、计算排序法，但需要扫描两遍，不符合题目要求.

算法分析：时间复杂度O(n)，空间复杂度O(1)，但扫描数组两遍。

public class Solution {
    public void sortColors(int[] A) {
        int[] count=new int[3];
        for(int i=0;i<A.length;i++) {
            count[A[i]]++;
        }
        int k=0;
        for(int i=0;i<3;i++) {
            for(int j=0;j<count[i];j++) {
                A[k++]=i;
            }
        }
    }
}

方法2、由于只有三种颜色，可以设置两个index，一个是red的index，一个是blue的index，两边往中间走。顺序扫描数组，遇到0则应该与red交换，同时i++，red++；遇到2,则应该与blue交换，同时blue--，而i不变；遇到1则i++，不作处理，扫描下一个。

算法分析：双指针，扫描数组一次。时间复杂度O(n)，空间复杂度O(1)。

public class Solution {
    public void sortColors(int[] A) {
        int red=0,blue=A.length-1;
        for(int i=0;i<blue+1;) {
            if(A[i]==0) {
                swap(A,i++,red++);
            }else if(A[i]==2) {
                swap(A,i,blue--);
            }else {
                i++;
            }
        }
    }
    private void swap(int[] A,int x,int y) {
        int temp=A[x];
        A[x]=A[y];
        A[y]=temp;
    }
}