LCP 06. 拿硬币

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;
    }
    
}