class Solution {
public int minCount(int[] coins) {
int sum = 0, len = coins.length;
for (int i = 0; i < len; i++){
while(coins[i] > 0){
coins[i] -= 2;
sum++;
}
}
return sum;
}
}
LCP 06. 拿硬币
阅读 28
2022-07-28
class Solution {
public int minCount(int[] coins) {
int sum = 0, len = coins.length;
for (int i = 0; i < len; i++){
while(coins[i] > 0){
coins[i] -= 2;
sum++;
}
}
return sum;
}
}
相关推荐
精彩评论(0)