class Solution {
public int findNumbers(int[] nums) {
int reult = 0;
for (int i = 0; i < nums.length; i++) {
int record = 0;
while (nums[i] > 0) {
record++;
nums[i] /= 10;
}
if (record % 2 == 0) reult++;
}
return reult;
}
}
08-15
549
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)