题目:https://leetcode-cn.com/problems/na-ying-bi/
答案:
public int minCount(int[] coins) {
int result = 0;
for(int i=0;i<coins.length;i++){
result += (coins[i]+1)/2;
}
return result;
}
题目:https://leetcode-cn.com/problems/na-ying-bi/
答案:
public int minCount(int[] coins) {
int result = 0;
for(int i=0;i<coins.length;i++){
result += (coins[i]+1)/2;
}
return result;
}