Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
Note:
You are not suppose to use the library's sort function for this problem.
class Solution {
public:
void sortColors(vector<int>& nums) {
int a[3];a[0]=0;a[1]=0;a[2]=0;
for(int i=0;i<nums.size();i++){
a[nums[i]]++;
}
cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
int tot=0;
for(int i=0;i<a[0];i++){
nums[tot++]=0;
}
for(int i=0;i<a[1];i++){
nums[tot++]=1;
}
for(int i=0;i<a[2];i++){
nums[tot++]=2;
}
}
};

本文介绍了一种不使用标准库排序功能的颜色排序算法,该算法能够将包含红色、白色和蓝色的对象按顺序排列。采用整数0、1、2分别表示红、白、蓝三种颜色,并通过计数每种颜色的数量来实现排序。
359

被折叠的 条评论
为什么被折叠?



