Skip to content

Navigation Menu

Sign in
Appearance settings

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

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

[pull] master from youngyangyang04:master #317

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 16 commits into AlgorithmAndLeetCode:master from youngyangyang04:master
Jul 27, 2023
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
16 commits
Select commit Hold shift + click to select a range
6ed304e
更新 动态规划理论基础 排版格式修复
jinbudaily Jul 26, 2023
b295b12
更新 0509.斐波那契数 排版格式修复
jinbudaily Jul 26, 2023
9b24f3c
更新 0070.爬楼梯 排版格式修复
jinbudaily Jul 26, 2023
86f794b
更新 0746.使用最小花费爬楼梯 排版格式修复
jinbudaily Jul 26, 2023
0e3500e
更新 动态规划 周末总结 排版格式修复
jinbudaily Jul 26, 2023
126aaac
更新 背包理论基础 排版格式修复
jinbudaily Jul 26, 2023
fc19feb
更新 0416.分割等和自己 0474.一和零 0494.目标和 1049.最后一块石头的重量II 排版格式修复
jinbudaily Jul 26, 2023
7ac2179
更新 完全背包理论基础 0139.单词拆分 0279.完全平方数 0322.零钱兑换 0377.组合总和IV 0518.零钱兑换II 多重...
jinbudaily Jul 26, 2023
89571ea
更新 0198.打家劫舍 0213.打家劫舍II 0337.打家劫舍III 排版格式修复
jinbudaily Jul 26, 2023
6b32268
更新 买卖股票的最佳时机系列 排版格式修复
jinbudaily Jul 26, 2023
038d509
更新 0674.最长连续递增序列 排版格式修复
jinbudaily Jul 26, 2023
9b0c0f2
更新 0392.判断子序列 0718.最长重复子数组 1035.不相交的线 1143.最长公共子序列 排版格式修复
jinbudaily Jul 26, 2023
a0edc60
更新 编辑距离系列 排版格式修复
jinbudaily Jul 26, 2023
4760924
更新 0516.最长回文子序列 0647.回文子串 动态规划总结 排版格式修复
jinbudaily Jul 26, 2023
04dd0ec
Merge branch 'master' of github.com:jinbudaily/leetcode-master
jinbudaily Jul 26, 2023
2691e27
Merge pull request #2208 from jinbudaily/master
youngyangyang04 Jul 27, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
更新 0674.最长连续递增序列 排版格式修复
  • Loading branch information
jinbudaily committed Jul 26, 2023
commit 038d50957cff8e3e370a1812ff36afa5feb72945
24 changes: 11 additions & 13 deletions problems/0300.最长上升子序列.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -33,7 +33,7 @@

## 算法公开课

**《代码随想录》算法视频公开课:[动态规划之子序列问题,元素不连续!| LeetCode:300.最长递增子序列](https://www.bilibili.com/video/BV1ng411J7xP),相信结合视频再看本篇题解,更有助于大家对本题的理解**。
**[《代码随想录》算法视频公开课](https://programmercarl.com/other/gongkaike.html)::[动态规划之子序列问题,元素不连续!| LeetCode:300.最长递增子序列](https://www.bilibili.com/video/BV1ng411J7xP),相信结合视频再看本篇题解,更有助于大家对本题的理解**。


## 思路
Expand Down Expand Up @@ -124,8 +124,8 @@ public:

## 其他语言版本

### Java:

Java:
```Java
class Solution {
public int lengthOfLIS(int[] nums) {
Expand All @@ -147,7 +147,7 @@ class Solution {
}
```

Python:
### Python:

DP
```python
Expand Down Expand Up @@ -189,7 +189,8 @@ class Solution:
return len(tails) # 返回递增子序列的长度

```
Go:
### Go:

```go
// 动态规划求解
func lengthOfLIS(nums []int) int {
Expand Down Expand Up @@ -248,7 +249,8 @@ func lengthOfLIS(nums []int ) int {
}
```

Javascript
### Javascript:

```javascript
const lengthOfLIS = (nums) => {
let dp = Array(nums.length).fill(1);
Expand All @@ -267,7 +269,7 @@ const lengthOfLIS = (nums) => {
};
```

TypeScript
### TypeScript:

```typescript
function lengthOfLIS(nums: number[]): number {
Expand All @@ -288,7 +290,8 @@ function lengthOfLIS(nums: number[]): number {
};
```

Rust:
### Rust:

```rust
pub fn length_of_lis(nums: Vec<i32>) -> i32 {
let mut dp = vec![1; nums.len() + 1];
Expand All @@ -307,13 +310,8 @@ pub fn length_of_lis(nums: Vec<i32>) -> i32 {









<p align="center">
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>

18 changes: 10 additions & 8 deletions problems/0674.最长连续递增序列.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,7 @@

## 算法公开课

**《代码随想录》算法视频公开课:[动态规划之子序列问题,重点在于连续!| LeetCode:674.最长连续递增序列](https://www.bilibili.com/video/BV1bD4y1778v),相信结合视频再看本篇题解,更有助于大家对本题的理解**。
**[《代码随想录》算法视频公开课](https://programmercarl.com/other/gongkaike.html):[动态规划之子序列问题,重点在于连续!| LeetCode:674.最长连续递增序列](https://www.bilibili.com/video/BV1bD4y1778v),相信结合视频再看本篇题解,更有助于大家对本题的理解**。


## 思路
Expand Down Expand Up @@ -157,8 +157,7 @@ public:

## 其他语言版本


Java:
### Java:

> 动态规划:
```java
Expand Down Expand Up @@ -207,7 +206,7 @@ public static int findLengthOfLCIS(int[] nums) {
}
```

Python:
### Python:

DP
```python
Expand Down Expand Up @@ -261,7 +260,8 @@ class Solution:
return result
```

Go:
### Go:

> 动态规划:
```go
func findLengthOfLCIS(nums []int) int {
Expand Down Expand Up @@ -302,7 +302,8 @@ func findLengthOfLCIS(nums []int) int {
}
```

Rust:
### Rust:

```rust
pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
if nums.is_empty() {
Expand All @@ -320,7 +321,7 @@ pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
}
```

Javascript:
### Javascript:

> 动态规划:
```javascript
Expand Down Expand Up @@ -363,7 +364,7 @@ const findLengthOfLCIS = (nums) => {
};
```

TypeScript:
### TypeScript:

> 动态规划:

Expand Down Expand Up @@ -409,3 +410,4 @@ function findLengthOfLCIS(nums: number[]): number {
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>

AltStyle によって変換されたページ (->オリジナル) /