Skip to content

Commit a9a5b73

Browse files
committed
feat: add python solution to leetcode problem: No.1295
添加leetcode题解:1295. 统计位数为偶数的数字
1 parent d0b645a commit a9a5b73

File tree

4 files changed

+33
-13
lines changed

4 files changed

+33
-13
lines changed

solution/1200-1299/1295.Find Numbers with Even Number of Digits/README.md

+9-6
Original file line numberDiff line numberDiff line change
@@ -42,15 +42,20 @@
4242

4343
## 解法
4444
<!-- 这里可写通用的实现逻辑 -->
45-
首先将数组元素转换为字符串,判断字符串长度是否为偶数即可
45+
首先将数组元素转换为字符串,判断字符串长度是否为偶数即可
4646

4747
<!-- tabs:start -->
4848

4949
### **Python3**
5050
<!-- 这里可写当前语言的特殊实现逻辑 -->
5151

5252
```python
53-
53+
class Solution:
54+
def findNumbers(self, nums: List[int]) -> int:
55+
res = 0
56+
for num in nums:
57+
res += (len(str(num)) & 1) == 0
58+
return res
5459
```
5560

5661
### **Java**
@@ -60,10 +65,8 @@
6065
class Solution {
6166
public int findNumbers(int[] nums) {
6267
int res = 0;
63-
for (int i = 0; i < nums.length; i++) {
64-
if (((String.valueOf(nums[i]).length()) & 1) == 0) {
65-
res++;
66-
}
68+
for (int num : nums) {
69+
res += (String.valueOf(num).length() & 1) == 0 ? 1 : 0;
6770
}
6871
return res;
6972
}

solution/1200-1299/1295.Find Numbers with Even Number of Digits/README_EN.md

+15-2
Original file line numberDiff line numberDiff line change
@@ -46,13 +46,26 @@ Only 1771 contains an even number of digits.
4646
### **Python3**
4747

4848
```python
49-
49+
class Solution:
50+
def findNumbers(self, nums: List[int]) -> int:
51+
res = 0
52+
for num in nums:
53+
res += (len(str(num)) & 1) == 0
54+
return res
5055
```
5156

5257
### **Java**
5358

5459
```java
55-
60+
class Solution {
61+
public int findNumbers(int[] nums) {
62+
int res = 0;
63+
for (int num : nums) {
64+
res += (String.valueOf(num).length() & 1) == 0 ? 1 : 0;
65+
}
66+
return res;
67+
}
68+
}
5669
```
5770

5871
### **...**
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,9 @@
11
class Solution {
22
public int findNumbers(int[] nums) {
33
int res = 0;
4-
for (int i = 0; i < nums.length; i++) {
5-
if (((String.valueOf(nums[i]).length()) & 1) == 0) {
6-
res++;
7-
}
4+
for (int num : nums) {
5+
res += (String.valueOf(num).length() & 1) == 0 ? 1 : 0;
86
}
97
return res;
108
}
11-
}
9+
}
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
class Solution:
2+
def findNumbers(self, nums: List[int]) -> int:
3+
res = 0
4+
for num in nums:
5+
res += (len(str(num)) & 1) == 0
6+
return res

0 commit comments

Comments
 (0)