class Solution {
public:
void sortColors(vector<int>& nums) {
int left = 0, right = nums.size() - 1;
for(int i = 0; i <= right; i++){
if(nums[i] == 0){
swap(nums[i], nums[left]);
left++;
continue;
}
if(nums[i] == 2){
swap(nums[i], nums[right]);
right--;
i--;
continue;
}
}
}
};
Accepted
87/87 cases passed (0 ms)
Your runtime beats 100 % of cpp submissions
Your memory usage beats 29.79 % of cpp submissions (8.1 MB)