class Solution {
public:
void sortColors(vector<int>& nums) {
int i = 0, j = nums.size()-1, k = 0;
while(k < j + 1){
if(nums[k] == 0){
swap(nums[i++], nums[k++]);
}else if(nums[k] == 1){
k++;
}else{
swap(nums[j--], nums[k]);
}
}
}
};
Sort Colors
最新推荐文章于 2021-04-15 12:30:39 发布