样例:
Input: nums = [12,345,2,6,7896]
Output: 2
Explanation:
12 contains 2 digits (even number of digits).
345 contains 3 digits (odd number of digits).
2 contains 1 digit (odd number of digits).
6 contains 1 digit (odd number of digits).
7896 contains 4 digits (even number of digits).
Therefore only 12 and 7896 contain an even number of digits.
限制要求:
- 数组中个数不大于500
- 数组中每个数 1 < = n u m s [ i ] < = 1 0 5 1 <= nums[i] <= 10^5 1<=nums[i]<=105
class Solution {
public int findNumbers(int[] nums) {
int num_even = 0;
int temp;
for(int i=0; i<nums.length; i++) {
temp = nums[i];
if((temp/100000) != 0) {
num_even++;
} else if((temp/1000) != 0 && (temp/10000 == 0)){
num_even++;
} else if((temp/10) != 0 && (temp/100 == 0)) {
num_even++;
}
}
return num_even;
}
}