mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
Merge pull request #2188 from fwqaaq/patch-47
Update 0718.最长重复子数组.md about rust
This commit is contained in:
@ -536,6 +536,29 @@ function findLength(nums1: number[], nums2: number[]): number {
|
||||
};
|
||||
```
|
||||
|
||||
Rust:
|
||||
|
||||
> 滚动数组
|
||||
|
||||
```rust
|
||||
impl Solution {
|
||||
pub fn find_length(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
|
||||
let (mut res, mut dp) = (0, vec![0; nums2.len()]);
|
||||
|
||||
for n1 in nums1 {
|
||||
for j in (0..nums2.len()).rev() {
|
||||
if n1 == nums2[j] {
|
||||
dp[j] = if j == 0 { 1 } else { dp[j - 1] + 1 };
|
||||
res = res.max(dp[j]);
|
||||
} else {
|
||||
dp[j] = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
res
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
Reference in New Issue
Block a user