day 43

3099.哈沙德数

int sumOfTheDigitsOfHarshadNumber(int x) {
    int t=0,y=x;
    while(y!=0){
        t+=y%10;
        y/=10;
    }
    if(x%t==0){
        return t;
    }else return -1;
}

LCP 06.拿硬币

int minCount(int* coins, int coinsSize){
    int x=0;
    for(int i=0;i<coinsSize;i++){
        if(coins[i]%2==0){
            x+=coins[i]/2;
        }else{
            x+=coins[i]/2+1;
        }
    }
    return x;
}

2923.找到冠军I

int findChampion(int** grid, int gridSize, int* gridColSize) {
    for(int i=0;i<gridSize;i++){
        int sum=0;
        for(int j=0;j<gridSize;j++){
            sum+=grid[i][j];
        }
        if(sum==gridSize-1){
            return i;
        }
    }
    return -1;
}