题解 | #牛的品种排序II#
牛的品种排序II
https://www.nowcoder.com/practice/43e49fbb98b4497ba46e185918188b1c
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
*
*
* @param cows int整型vector
* @return int整型vector
*/
vector<int> sortCows(vector<int>& cows) {
// write code here
int n = cows.size();
vector<int> c(n,0);
for(int i=0;i<n;i++){
c[cows[i]]++;
}
for(int i=1;i<3;i++){
c[i] += c[i-1];
}
vector<int> r(n);
for(int i=n-1;i>=0;i--){
int index = c[cows[i]]-1;
r[index] = cows[i];
c[cows[i]]--;
}
for(int i=0;i<n;i++){
cows[i] = r[i];
}
return cows;
}
};
