LeetCode 1295. Find Numbers with Even Number of Digits

最新推荐文章于 2022-04-02 14:49:39 发布

原创最新推荐文章于 2022-04-02 14:49:39 发布 · 786 阅读

0 ·

CC 4.0 BY-SA版权

AC路漫漫专栏收录该内容

180 篇文章

订阅专栏

本文介绍了一种算法，用于计算数组中包含偶数位数的整数的数量。通过遍历数组，将每个元素转换为字符串并检查其长度是否为偶数，以此来判断元素的位数是否符合要求。

Given an array nums of integers, return how many of them contain an even number of digits.

Example 1:

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.

Example 2:

Input: nums = [555,901,482,1771]
Output: 1 
Explanation: 
Only 1771 contains an even number of digits.

Constraints:

1 <= nums.length <= 500
1 <= nums[i] <= 10^5

求数组中位数是偶数的数字个数。

//java
class Solution {
    public int findNumbers(int[] nums) {
        int count = 0;
        for(int i:nums){
            if(String.valueOf(i).length() % 2 == 0)
                count++;
        }
        return count;
    }
}