Skip to content

Commit 837e904

Browse files
committed
feat: add solutions to lc problem: No.1295
No.1295.Find Numbers with Even Number of Digits
1 parent 7ccaed7 commit 837e904

File tree

4 files changed

+52
-0
lines changed

4 files changed

+52
-0
lines changed

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

+20
Original file line numberDiff line numberDiff line change
@@ -131,6 +131,16 @@ function findNumbers(nums: number[]): number {
131131
}
132132
```
133133

134+
#### Rust
135+
136+
```rust
137+
impl Solution {
138+
pub fn find_numbers(nums: Vec<i32>) -> i32 {
139+
nums.iter().filter(|&x| x.to_string().len() % 2 == 0).count() as i32
140+
}
141+
}
142+
```
143+
134144
#### JavaScript
135145

136146
```js
@@ -143,6 +153,16 @@ var findNumbers = function (nums) {
143153
};
144154
```
145155

156+
#### C#
157+
158+
```cs
159+
public class Solution {
160+
public int FindNumbers(int[] nums) {
161+
return nums.Count(x => x.ToString().Length % 2 == 0);
162+
}
163+
}
164+
```
165+
146166
<!-- tabs:end -->
147167

148168
<!-- solution:end -->

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

+20
Original file line numberDiff line numberDiff line change
@@ -129,6 +129,16 @@ function findNumbers(nums: number[]): number {
129129
}
130130
```
131131

132+
#### Rust
133+
134+
```rust
135+
impl Solution {
136+
pub fn find_numbers(nums: Vec<i32>) -> i32 {
137+
nums.iter().filter(|&x| x.to_string().len() % 2 == 0).count() as i32
138+
}
139+
}
140+
```
141+
132142
#### JavaScript
133143

134144
```js
@@ -141,6 +151,16 @@ var findNumbers = function (nums) {
141151
};
142152
```
143153

154+
#### C#
155+
156+
```cs
157+
public class Solution {
158+
public int FindNumbers(int[] nums) {
159+
return nums.Count(x => x.ToString().Length % 2 == 0);
160+
}
161+
}
162+
```
163+
144164
<!-- tabs:end -->
145165

146166
<!-- solution:end -->
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
impl Solution {
2+
pub fn find_numbers(nums: Vec<i32>) -> i32 {
3+
nums.iter()
4+
.filter(|&x| x.to_string().len() % 2 == 0)
5+
.count() as i32
6+
}
7+
}
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
public class Solution {
2+
public int FindNumbers(int[] nums) {
3+
return nums.Count(x => x.ToString().Length % 2 == 0);
4+
}
5+
}

0 commit comments

Comments
 (0)