-
Notifications
You must be signed in to change notification settings - Fork 0
/
1295.find-numbers-with-even-number-of-digits.java
80 lines (68 loc) · 1.58 KB
/
1295.find-numbers-with-even-number-of-digits.java
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/*
* @lc app=leetcode id=1295 lang=java
*
* [1295] Find Numbers with Even Number of Digits
*
* https://leetcode.com/problems/find-numbers-with-even-number-of-digits/description/
*
* algorithms
* Easy (80.14%)
* Likes: 481
* Dislikes: 65
* Total Accepted: 187.1K
* Total Submissions: 233.6K
* Testcase Example: '[12,345,2,6,7896]'
*
* 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
*
*
*/
// @lc code=start
class Solution {
public int findNumbers(int[] nums) {
int even=0;
for(int i=0;i<nums.length;i++){
int sum=nums[i];
int count=0;
while(sum>0){
sum=sum/10;
count++;
}
if(count%2==0)
even++;
}
return even;
}
}
// @lc code=end