【leetcode】统计位数为偶数的数字

 

int findNumbers(int* nums, int numsSize){
    int i,cnt,total=0,val;
    for (i=0; i<numsSize; i++)
    {
        val=nums[i];
        cnt=0;
        while(val){
            cnt++;
            val /=10;
        }
        if (cnt % 2 == 0) total++;
    }
    return total;
}