[leetcode] 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

分析

题目的意思是：给定一个数组，统计每个数字包含的数的个数是偶数的个数。这道题我的思路很直接，一个一个的遍历判断就行了，好像还有数学的方法，能够想到真是厉害了。

代码

class Solution:
    def findNumbers(self, nums: List[int]) -> int:
        res=0
        for num in nums:
            cnt=0
            while(num>0):
                num=num//10
                cnt+=1
                
            if(cnt%2==0):
                res+=1
        return res

参考文献

[LeetCode] Python3 intuitive solution w/ explanation