Howard的程式筆記

1295. 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

1
2
3
4
5
6
7
8
9
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

1
2
3
4
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] <= 105

我的解題

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
    public int findNumbers(int[] nums) {
        int ans = 0;		//答案數
        for(int i=0;i<nums.length;i++){
            int digit = 0;		//字數量
            while(nums[i] != 0){
                nums[i] /= 10;
                ++digit;		//若num[i]不等於0，則除以10且字數量+1
            }
            if (digit%2 == 0){
			ans++;		//若字數量除以2且商為0，則答案數+1
			}   
		}
        return ans;		//回傳答案數
    }
}