題目
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 <= 5001 <= nums[i] <= 10^5
題目大意
給你一個整數數組 nums，請你返回其中位數為 偶數 的數字的個數。
提示：
- 1 <= nums.length <= 500
- 1 <= nums[i] <= 10^5
解題思路
- 給你一個整數數組，要求輸出位數為偶數的數字的個數。
- 簡單題，把每個數字轉換為字符串判斷長度是否是偶數即可。
參考代碼
func findNumbers(nums []int) int {
res := 0
for _, n := range nums {
res += 1 - len(strconv.Itoa(n))%2
}
return res
}