Leetcode 1295. Find Numbers with Even Number of Digits (Java)

内心的脊梁

于 2022-03-22 11:30:51 发布

阅读量557

点赞数

本文链接：https://blog.csdn.net/weixin_58080442/article/details/123656343

版权

本文介绍如何使用Java解决一个关于数组的编程问题，即找出含有偶数位数字的整数元素个数。通过示例和代码实现，帮助读者理解如何遍历数组并判断每个数字的位数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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] <= 105

class Solution {
    public int findNumbers(int[] nums) {
         int x = 0;
        for (int i = 0; i < nums.length; i++) {
            int digit = Integer.toString(nums[i]).length();
            if (digit % 2 == 0) {
                x += 1;
            }            
        }
        return x;
    }
}