Day 12 Leet code series, today we will be picking the problem sort colors (https://leetcode.com/problems/sort-colors/).

Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue.

We will use the integers 0, 1, and 2 to represent the color red, white, and blue, 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]

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int left = 0;
        int right = nums.size()-1;
        int mid = 0;
        while(mid<=right){
            if(nums[mid] == 1 ){
                mid++;
            }
            else if(nums[mid] == 0){
                swap(nums[mid], nums[left]);
                mid++;
                left++;
            }
            else {
                swap(nums[mid],nums[right]);
                right--;
            }
        }
    }
};