Update 0674.最长连续递增序列.md about rust

This commit is contained in:
fwqaaq
2023-07-18 16:51:54 +08:00
committed by GitHub
parent f90e8a2081
commit 826554682f

View File

@ -303,6 +303,9 @@ func findLengthOfLCIS(nums []int) int {
``` ```
Rust: Rust:
>动态规划
```rust ```rust
pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 { pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
if nums.is_empty() { if nums.is_empty() {
@ -320,6 +323,25 @@ pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
} }
``` ```
> 贪心
```rust
impl Solution {
pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
let (mut res, mut count) = (1, 1);
for i in 1..nums.len() {
if nums[i] > nums[i - 1] {
count += 1;
res = res.max(count);
continue;
}
count = 1;
}
res
}
}
```
Javascript Javascript
> 动态规划: > 动态规划: