Leetcode 1295. 统计位数为偶数的数字 js & c

js版

/**
 * @param {number[]} nums
 * @return {number}
 */
var findNumbers = function(nums) {
  return nums.filter(num => !((num+'').length & 1)).length
};

c版

int findNumbers(int* nums, int numsSize){
    int r = 0;
    while(numsSize > 0){
        int item = nums[--numsSize];
        int len = 0;
        while(item > 0){
            item = (item - item % 10)/10;
            len++;
        }
        if(!(len & 1)){
            r++;
        }
    }
    return r;
}