Commit 038d509

committed

更新 0674.最长连续递增序列排版格式修复

1 parent 6b32268 commit 038d509Copy full SHA for 038d509

File tree

2 files changed

+21

-21

lines changed

problems
- 0300.最长上升子序列.md
- 0674.最长连续递增序列.md

2 files changed

+21

-21

lines changed

`‎problems/0300.最长上升子序列.md‎`

Lines changed: 11 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -33,7 +33,7 @@`
`33`	`33`
`34`	`34`	`## 算法公开课`
`35`	`35`
`36`		`-《代码随想录》算法视频公开课:[动态规划之子序列问题,元素不连续!\| LeetCode:300.最长递增子序列](https://www.bilibili.com/video/BV1ng411J7xP),相信结合视频再看本篇题解,更有助于大家对本题的理解。`
	`36`	`+[《代码随想录》算法视频公开课](https://programmercarl.com/other/gongkaike.html)::[动态规划之子序列问题,元素不连续!\| LeetCode:300.最长递增子序列](https://www.bilibili.com/video/BV1ng411J7xP),相信结合视频再看本篇题解,更有助于大家对本题的理解。`
`37`	`37`
`38`	`38`
`39`	`39`	`## 思路`
`@@ -124,8 +124,8 @@ public:`
`124`	`124`
`125`	`125`	`## 其他语言版本`
`126`	`126`
	`127`	`+### Java:`
`127`	`128`
`128`		`-Java:`
`129`	`129`	```Java
`130`	`130`	`class Solution {`
`131`	`131`	`public int lengthOfLIS(int[] nums) {`
`@@ -147,7 +147,7 @@ class Solution {`
`147`	`147`	`}`
`148`	`148`	```
`149`	`149`
`150`		`-Python:`
	`150`	`+### Python:`
`151`	`151`
`152`	`152`	`DP`
`153`	`153`	```python
`@@ -189,7 +189,8 @@ class Solution:`
`189`	`189`	`return len(tails) # 返回递增子序列的长度`
`190`	`190`
`191`	`191`	```
`192`		`-Go:`
	`192`	`+### Go:`
	`193`	`+`
`193`	`194`	```go
`194`	`195`	`// 动态规划求解`
`195`	`196`	`func lengthOfLIS(nums []int) int {`
`@@ -248,7 +249,8 @@ func lengthOfLIS(nums []int ) int {`
`248`	`249`	`}`
`249`	`250`	```
`250`	`251`
`251`		`-Javascript`
	`252`	`+### Javascript:`
	`253`	`+`
`252`	`254`	```javascript
`253`	`255`	`const lengthOfLIS = (nums) => {`
`254`	`256`	`let dp = Array(nums.length).fill(1);`
`@@ -267,7 +269,7 @@ const lengthOfLIS = (nums) => {`
`267`	`269`	`};`
`268`	`270`	```
`269`	`271`
`270`		`-TypeScript`
	`272`	`+### TypeScript:`
`271`	`273`
`272`	`274`	```typescript
`273`	`275`	`function lengthOfLIS(nums: number[]): number {`
`@@ -288,7 +290,8 @@ function lengthOfLIS(nums: number[]): number {`
`288`	`290`	`};`
`289`	`291`	```
`290`	`292`
`291`		`-Rust:`
	`293`	`+### Rust:`
	`294`	`+`
`292`	`295`	```rust
`293`	`296`	`pub fn length_of_lis(nums: Vec<i32>) -> i32 {`
`294`	`297`	`let mut dp = vec![1; nums.len() + 1];`
`@@ -307,13 +310,8 @@ pub fn length_of_lis(nums: Vec<i32>) -> i32 {`
`307`	`310`
`308`	`311`
`309`	`312`
`310`		`-`
`311`		`-`
`312`		`-`
`313`		`-`
`314`		`-`
`315`		`-`
`316`	`313`	`<p align="center">`
`317`	`314`	`<a href="https://programmercarl.com/other/kstar.html" target="_blank">`
`318`	`315`	`<img src="../pics/网站星球宣传海报.jpg" width="1000"/>`
`319`	`316`	`</a>`
	`317`	`+`

`‎problems/0674.最长连续递增序列.md‎`

Lines changed: 10 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -29,7 +29,7 @@`
`29`	`29`
`30`	`30`	`## 算法公开课`
`31`	`31`
`32`		`-《代码随想录》算法视频公开课:[动态规划之子序列问题,重点在于连续!\| LeetCode:674.最长连续递增序列](https://www.bilibili.com/video/BV1bD4y1778v),相信结合视频再看本篇题解,更有助于大家对本题的理解。`
	`32`	`+[《代码随想录》算法视频公开课](https://programmercarl.com/other/gongkaike.html):[动态规划之子序列问题,重点在于连续!\| LeetCode:674.最长连续递增序列](https://www.bilibili.com/video/BV1bD4y1778v),相信结合视频再看本篇题解,更有助于大家对本题的理解。`
`33`	`33`
`34`	`34`
`35`	`35`	`## 思路`
`@@ -157,8 +157,7 @@ public:`
`157`	`157`
`158`	`158`	`## 其他语言版本`
`159`	`159`
`160`		`-`
`161`		`-Java:`
	`160`	`+### Java:`
`162`	`161`
`163`	`162`	`> 动态规划:`
`164`	`163`	```java
`@@ -207,7 +206,7 @@ public static int findLengthOfLCIS(int[] nums) {`
`207`	`206`	`}`
`208`	`207`	```
`209`	`208`
`210`		`-Python:`
	`209`	`+### Python:`
`211`	`210`
`212`	`211`	`DP`
`213`	`212`	```python
`@@ -261,7 +260,8 @@ class Solution:`
`261`	`260`	`return result`
`262`	`261`	```
`263`	`262`
`264`		`-Go:`
	`263`	`+### Go:`
	`264`	`+`
`265`	`265`	`> 动态规划:`
`266`	`266`	```go
`267`	`267`	`func findLengthOfLCIS(nums []int) int {`
`@@ -302,7 +302,8 @@ func findLengthOfLCIS(nums []int) int {`
`302`	`302`	`}`
`303`	`303`	```
`304`	`304`
`305`		`-Rust:`
	`305`	`+### Rust:`
	`306`	`+`
`306`	`307`	```rust
`307`	`308`	`pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {`
`308`	`309`	`if nums.is_empty() {`
`@@ -320,7 +321,7 @@ pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {`
`320`	`321`	`}`
`321`	`322`	```
`322`	`323`
`323`		`-Javascript:`
	`324`	`+### Javascript:`
`324`	`325`
`325`	`326`	`> 动态规划:`
`326`	`327`	```javascript
`@@ -363,7 +364,7 @@ const findLengthOfLCIS = (nums) => {`
`363`	`364`	`};`
`364`	`365`	```
`365`	`366`
`366`		`-TypeScript:`
	`367`	`+### TypeScript:`
`367`	`368`
`368`	`369`	`> 动态规划:`
`369`	`370`
`@@ -409,3 +410,4 @@ function findLengthOfLCIS(nums: number[]): number {`
`409`	`410`	`<a href="https://programmercarl.com/other/kstar.html" target="_blank">`
`410`	`411`	`<img src="../pics/网站星球宣传海报.jpg" width="1000"/>`
`411`	`412`	`</a>`
	`413`	`+`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 038d509

File tree

2 files changed

2 files changed

`‎problems/0300.最长上升子序列.md‎`

`‎problems/0674.最长连续递增序列.md‎`

0 commit comments