|
1
2
3
4
5
6
|
class Solution:
def findNumbers(self, nums: List[int]) -> int:
ans=0
for i in nums:
if len(str(i))%2==0: ans+=1
return ans
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
| Leetcode 1662. Check If Two String Arrays are Equivalent (0) | 2021.08.17 |
|---|---|
| Leetcode 709. To Lower Case (0) | 2021.08.17 |
| Leetcode 905. Sort Array By Parity (0) | 2021.07.23 |
| Leetcode 1827. Minimum Operations to Make the Array Increasing (0) | 2021.07.21 |
| Leetcode 1323. Maximum 69 Number (0) | 2021.07.21 |
댓글