1295. Find Numbers with Even Number of Digits*

最新推荐文章于 2022-03-22 11:30:51 发布

珍妮的选择

最新推荐文章于 2022-03-22 11:30:51 发布

阅读量839

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/Eric_1993/article/details/103674787

版权

LeetCode 专栏收录该内容

416 篇文章

订阅专栏

1295. Find Numbers with Even Number of Digits*

https://leetcode.com/problems/find-numbers-with-even-number-of-digits/

题目描述

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

C++ 实现 1

class Solution {
private:
    int num_digits(int a) {
        if (a == 0) return 1;
        int count = 0;
        while (a) {
            count ++;
            a /= 10;
        }
        return count;
    }
public:
    int findNumbers(vector<int>& nums) {
        int res = 0;
        for (auto &i : nums) {
            auto count = num_digits(i);
            if (count % 2 == 0) res ++;
        }
        return res;
    }
};