algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2185 from fwqaaq/patch-45

Browse Source 
Update 0300.最长上升子序列.md 优化 Rust 和 Java
This commit is contained in:
程序员Carl
2023-08-01 17:01:04 +08:00
committed by GitHub
parent 897a31c801 9a720d83b7
commit 6b19a60ef1
1 changed files with 4 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
problems/0300.最长上升子序列.md
View File

@ -130,18 +130,16 @@ public:
class Solution { class Solution {
public int lengthOfLIS(int[] nums) { public int lengthOfLIS(int[] nums) {
int[] dp = new int[nums.length]; int[] dp = new int[nums.length];
int res = 0;
Arrays.fill(dp, 1); Arrays.fill(dp, 1);
for (int i = 0; i < dp.length; i++) { for (int i = 1; i < dp.length; i++) {
for (int j = 0; j < i; j++) { for (int j = 0; j < i; j++) {
if (nums[i] > nums[j]) { if (nums[i] > nums[j]) {
dp[i] = Math.max(dp[i], dp[j] + 1); dp[i] = Math.max(dp[i], dp[j] + 1);
} }
}
}
int res = 0;
for (int i = 0; i < dp.length; i++) {
res = Math.max(res, dp[i]); res = Math.max(res, dp[i]);
} }
}
return res; return res;
} }
} }
@ -294,7 +292,7 @@ function lengthOfLIS(nums: number[]): number {
```rust ```rust
pub fn length_of_lis(nums: Vec<i32>) -> i32 { pub fn length_of_lis(nums: Vec<i32>) -> i32 {
let mut dp = vec![1; nums.len() + 1]; let mut dp = vec![1; nums.len()];
let mut result = 1; let mut result = 1;
for i in 1..nums.len() { for i in 1..nums.len() {
for j in 0..i { for j in 0..i {
@ -309,7 +307,6 @@ pub fn length_of_lis(nums: Vec<i32>) -> i32 {
``` ```
<p align="center"> <p align="center">
<a href="https://programmercarl.com/other/kstar.html" target="_blank"> <a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/> <img src="../pics/网站星球宣传海报.jpg" width="1000"/>