Leetcode 75. Sort Colors

o(n) two-pass

public class Solution {
    public void sortColors(int[] nums) {
        if (nums.length == 0) return;
        int cnt1 = 0, cnt2 = 0, cnt3 = 0;
        for (int num : nums) {
            if (num == 0) cnt1++;
            else if (num == 1) cnt2++;
            else cnt3++;
        }
        int i = 0;
        while (i < nums.length) {
            if (i < cnt1) nums[i] = 0;
            else if (i>=cnt1 && i<cnt1+cnt2) nums[i] = 1;
            else nums[i] = 2;
            i++;
        }
    }
}

o(n) one-pass, Dutch national flag problem

public class Solution {
    public void sortColors(int[] nums) {
        int tmp;
        int i =0, j = 0, k = nums.length-1;
        while (j <= k) {
            if (nums[j] == 0) {
                tmp=nums[j]; nums[j]=nums[i]; nums[i]=tmp;
                i++;j++;
            }
            else if (nums[j] == 1) 
                j++;
            else {
                tmp=nums[j]; nums[j]=nums[k]; nums[k]=tmp;
                k--;
            }
        }
    }
}