Commit ec46abc

authored

Merge pull request youngyangyang04#2187 from fwqaaq/patch-46

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

2 parents 78f1d9f + 3cf32c8 commit ec46abcCopy full SHA for ec46abc

File tree

+23

-1

lines changed

+23

-1

lines changed

Lines changed: 23 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -302,8 +302,9 @@ func findLengthOfLCIS(nums []int) int {`
`302`	`302`	`}`
`303`	`303`	```
`304`	`304`
`305`		`-### Rust:`
`306`	`305`
	`306`	`+### Rust:`
	`307`	`+>动态规划`
`307`	`308`	```rust
`308`	`309`	`pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {`
`309`	`310`	`if nums.is_empty() {`
`@@ -321,6 +322,27 @@ pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {`
`321`	`322`	`}`
`322`	`323`	```
`323`	`324`
	`325`	`+`
	`326`	`+> 贪心`
	`327`	`+`
	`328`	+```rust
	`329`	`+impl Solution {`
	`330`	`+ pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {`
	`331`	`+ let (mut res, mut count) = (1, 1);`
	`332`	`+ for i in 1..nums.len() {`
	`333`	`+ if nums[i] > nums[i - 1] {`
	`334`	`+ count += 1;`
	`335`	`+ res = res.max(count);`
	`336`	`+ continue;`
	`337`	`+ }`
	`338`	`+ count = 1;`
	`339`	`+ }`
	`340`	`+ res`
	`341`	`+ }`
	`342`	`+}`
	`343`	+```
	`344`	`+`
	`345`	`+`
`324`	`346`	`### Javascript:`
`325`	`347`
`326`	`348`	`> 动态规划:`

Comments

(0)