README_EN.md

1295. Find Numbers with Even Number of Digits

中文文档

Description

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

Solutions

Python3

class Solution:
    def findNumbers(self, nums: List[int]) -> int:
        return sum(1 for num in nums if (len(str(num)) & 1) == 0)

Java

class Solution {
    public int findNumbers(int[] nums) {
        int s = 0;
        for (int num : nums) {
            if ((String.valueOf(num).length() & 1) == 0) {
                ++s;
            }
        }
        return s;
    }
}

C++

class Solution {
public:
    int findNumbers(vector<int>& nums) {
        int s = 0;
        for (int num : nums) {
            s += (to_string(num).size() & 1) == 0;
        }
        return s;
    }
};

Go

func findNumbers(nums []int) int {
	s := 0
	for _, num := range nums {
		if (len(strconv.Itoa(num)) & 1) == 0 {
			s++
		}
	}
	return s
}

...