feat: add rust solution to lc problem: No.3392 (#4375)

No.3392.Count Subarrays of Length Three With a Condition
This commit is contained in:
Libin YANG 2025-04-27 06:30:47 +08:00 committed by GitHub
parent 7db519a74c
commit 186aa5e071
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
3 changed files with 43 additions and 0 deletions

View File

@ -143,6 +143,22 @@ function countSubarrays(nums: number[]): number {
}
```
#### Rust
```rust
impl Solution {
pub fn count_subarrays(nums: Vec<i32>) -> i32 {
let mut ans = 0;
for i in 1..nums.len() - 1 {
if (nums[i - 1] + nums[i + 1]) * 2 == nums[i] {
ans += 1;
}
}
ans
}
}
```
<!-- tabs:end -->
<!-- solution:end -->

View File

@ -139,6 +139,22 @@ function countSubarrays(nums: number[]): number {
}
```
#### Rust
```rust
impl Solution {
pub fn count_subarrays(nums: Vec<i32>) -> i32 {
let mut ans = 0;
for i in 1..nums.len() - 1 {
if (nums[i - 1] + nums[i + 1]) * 2 == nums[i] {
ans += 1;
}
}
ans
}
}
```
<!-- tabs:end -->
<!-- solution:end -->

View File

@ -0,0 +1,11 @@
impl Solution {
pub fn count_subarrays(nums: Vec<i32>) -> i32 {
let mut ans = 0;
for i in 1..nums.len() - 1 {
if (nums[i - 1] + nums[i + 1]) * 2 == nums[i] {
ans += 1;
}
}
ans
}
}