1295.统计位数为偶数的数字
我的题解:
class Solution {
public int findNumbers(int[] nums) {
Arrays.sort(nums);
int size=0;
int power=1;
for (int i = 0; i < nums.length; i++) {
double pow = Math.pow(10, power);
nums[i]= (int) (nums[i]/pow);
while(nums[i]!=0){
nums[i]=nums[i]/10;
power++;
}
if(power%2==0) size++;
}
return size;
}
}
官方题解:(真是无所不用其极)
class Solution {
public int findNumbers(int[] nums) {
int ans = 0;
for (int num : nums) {
if (String.valueOf(num).length() % 2 == 0) {
ans++;
}
}
return ans;
}
}
作者:力扣官方题解
链接:https://leetcode.cn/problems/find-numbers-with-even-number-of-digits/solutions/101807/tong-ji-wei-shu-wei-ou-shu-de-shu-zi-by-leetcode-s/
来源:力扣(LeetCode)