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

Update 0300.最长上升子序列.md

Browse Source 
最新力扣新增测试案例
nums = [0] 预期输出 1 实际输出 0
就是nums.length == 0 时 要return 1
This commit is contained in:
LePing Huang
2023-12-05 16:52:40 +08:00
committed by GitHub
parent f47dd60148
commit a18bca3625
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -130,7 +130,7 @@ public:
class Solution {
public int lengthOfLIS(int[] nums) {
int[] dp = new int[nums.length];
int res = 0;
int res = 1;
Arrays.fill(dp, 1);
for (int i = 1; i < dp.length; i++) {
for (int j = 0; j < i; j++) {