class Solution {
public:
void sortColors(vector<int>& nums) {
int r1 = -1;
int r2 = -1;
int n = nums.size();
for(int i = 0; i < n; i++){
if(nums[i] < 2){
r2++;
swap(nums,i,r2);
if(nums[r2] < 1){
r1++;
swap(nums,r1,r2);
}
}
}
}
void swap(vector<int>& nums, int i, int j){
int t = nums[i];
nums[i] = nums[j];
nums[j] = t;
}
};
Leetcode 75. 颜色分类
最新推荐文章于 2024-05-04 03:45:26 发布