day 60

3270.求出数字答案

int generateKey(int num1, int num2, int num3) {
    int a[3][4]={0};
    int t=0;
    while(num1!=0){
        a[0][t++]=num1%10;
        num1/=10;
    }
    t=0;
    while(num2!=0){
        a[1][t++]=num2%10;
        num2/=10;
    }
    t=0;
    while(num3!=0){
        a[2][t++]=num3%10;
        num3/=10;
    }  
    int sum=0;
    for(int i=3;i>=0;i--){
        int min=a[0][i];
        for(int j=1;j<=2;j++){
            if(a[j][i]<min){
                min=a[j][i];
            }
        }
        sum=sum*10+min;
    }
    return sum; 
}

2283.判断一个数的数字计数是否等于数位的值

bool digitCount(char* num) {
    int t = strlen(num);
    int* a = (int*)malloc(sizeof(int) * 10);
    memset(a, 0, sizeof(int) * 10);
    for (int i = 0; i < t; i++) {
        a[num[i] - '0']++;
    }
    for (int i = 0; i < t; i++) {
        if (a[i] != num[i] - '0') {
            return false;
        }
    }
    return true;
}