#75.Sort Colors [LeetCode Grind 75 in Java]

class Solution {

    public void sortColors(int[] nums) {
        int l = 0;
        int r = nums.length - 1;
        int m = 0;

        while(l < r && m <= r){
            if(nums[m] == 2){
                //swap(nums[m] , nums[r]);
                int t = nums[m];
                nums[m] = nums[r];
                nums[r] = t;
                r --;
            }else if(nums[m] == 0){
                //swap(nums[i] , nums[l]);
                int t = nums[m];
                nums[m] = nums[l];
                nums[l] = t;
                l ++;
                m ++;
            }else{
                m ++;
            }
        } 

    }
}