Leetcode刷题笔记(c++)

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

class Solution {
public:
    void sortColors(vector& nums) {
        vectorv(3,0);
        for(int i:nums)v[i]++;
        // cout<