leetcode -- 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.

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?

two-pass solution

public class Solution {
    public void sortColors(int[] A) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int len = A.length;
        Map<Integer, Integer> times = new HashMap<Integer, Integer>();
        for(int i = 0; i < len; i++){
            if(times.get(A[i]) != null){
                times.put(A[i], times.get(A[i]) + 1);
            } else {
                times.put(A[i], 1);
            }
        }
        
        //A = new int[len];
        int red = 0, white = 0, blue = 0;
        
        if(times.get(0) != null)
            red = times.get(0);
        
        if(times.get(1) != null)
            white = times.get(1);
        
        if(times.get(2) != null)
            blue = times.get(2);
            
        for(int i = 0; i < len; i++){
            if(i < red){
                A[i] = 0;
            } else if(i >= red && i < red + white){
                A[i] = 1;
            } else {
                A[i] = 2;
            }
        }
    }
}

 one pass

维护两个指针：redIdx，blueIdx，从头开始扫描数组直到blueIdx(包括blueIdx)

1.A[i]==0时，将A[i]与A[redIdx]交换，redIdx++，i++

2.A[i]==2时，将A[i]与A[blueIdx]交换，blueIdx--，

3.A[i]==1时，i++

public class Solution {
    public void sortColors(int[] A) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int len = A.length;
        int i = 0, redIdx = 0, blueIdx = len - 1;
        while(i < blueIdx + 1){
            if(A[i] == 0){
                swap(A, i, redIdx);
                redIdx ++;
                i ++;
            } else if(A[i] == 2){
                swap(A, i, blueIdx);
                blueIdx --;
            } else{
                i++;
            }
        }
    }
    
    public void swap(int[] A, int i, int idx){
        int tmp = A[i];
        A[i] = A[idx];
        A[idx] = tmp;
    }
}