题解 | #牛的品种排序II#
牛的品种排序II
https://www.nowcoder.com/practice/43e49fbb98b4497ba46e185918188b1c
所用语言
Java
所用知识
数组
解题思路
记录0和1有多少个,并替换原来的值,剩下的为2
完整代码
public int[] sortCows (int[] cows) {
// write code here
int a = 0, b = 0;
for (int i = 0; i < cows.length; i++) {
if (cows[i] == 0) a++;
if (cows[i] == 1) b++;
}
for (int i = 0; i < cows.length; i++) {
if(a>0){
cows[i]=0;
a--;
}else if(b>0){
cows[i]=1;
b--;
}else cows[i]=2;
}
return cows;
}
#牛的品种排序II#