lc-75

//Given an array nums with n objects colored red, white, or blue, sort them in-p
//lace so that objects of the same color are adjacent, with the colors in the orde
//r red, white, and blue. 
//
// We will use the integers 0, 1, and 2 to represent the color red, white, and b
//lue, respectively. 
//
// You must solve this problem without using the library's sort function. 
//
// 
// Example 1: 
//
// 
//Input: nums = [2,0,2,1,1,0]
//Output: [0,0,1,1,2,2]
// 
//
// Example 2: 
//
// 
//Input: nums = [2,0,1]
//Output: [0,1,2]
// 
//
// 
// Constraints: 
//
// 
// n == nums.length 
// 1 <= n <= 300 
// nums[i] is either 0, 1, or 2. 
// 
//
// 
// Follow up: Could you come up with a one-pass algorithm using only constant ex
//tra space? 
// Related Topics Array Two Pointers Sorting 
// 👍 11309 👎 439


//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public void sortColors(int[] nums) {
        int zero, one, two, i;
        zero = 0;
        one = 0;
        two = 0;

        for(i = 0; i < nums.length; i++){
            if(nums[i] == 0){
                zero ++;
                continue;
            }
            if(nums[i] == 1){
                one ++;
                continue;
            }
            if(nums[i] == 2){
                two ++;
                continue;
            }
        }

        for(i = 0; i < zero; i++){
            nums[i] = 0;
        }
        for(i = 0; i < one; i++){
            nums[i + zero] = 1;
        }
        for(i = 0; i < two; i++){
            nums[i + zero + one] = 2;
        }
    }
}
//leetcode submit region end(Prohibit modification and deletion)