LeetCode/C++/1295.cpp at master · strengthen/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
public:
    int findNumbers(vector<int>& nums) {
        int count=0;
        for(int i=0; i<nums.size(); ++i){
            int c=0;
            while(nums[i]>0){
                nums[i] /= 10;
                c++;
            }
            if(c%2==0) ++count;
        }
        return count;
    }
};
__________________________________________________________________________________________________
sample 4 ms submission
class Solution {
public:
    int findNumbers(vector<int>& nums) {
        int count=0;
        for(int i=0; i<nums.size(); ++i){
            if(nums[i]>9 && nums[i]<100 || nums[i]>999 && nums[i]<10000 || nums[i]>99999 && nums[i]<1000000)
                ++count;
        }
        return count;
    }
};
__________________________________________________________________________________________________
sample 8 ms submission
class Solution {
public:
    int findNumbers(vector<int>& nums) {
        string s;
        int count=0;
        for(int i = 0; i < nums.size(); i ++)
        {
            s = to_string(nums[i]);
            if (s.length() %2 ==0)
                count++;
        }
        return count;
    }
};