dígitos de leetcode incluso


int findNumbers(int* nums, int numsSize){
        
        int c = 0;
        
        for(int i = 0; i < numsSize; i++){
               
                if(numDigit(nums[i]) % 2 == 0){
                        c++;
                } 
        }

        return c;
}

Inexpensive Iguana