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

最新力扣新增测试案例 nums = [0] 预期输出 1 实际输出 0 就是nums.length == 0 时要return 1
lilian-r · Dec 5, 2023 · a18bca3 · a18bca3
1 parent f47dd60
commit a18bca3
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/problems/0300.最长上升子序列.md b/problems/0300.最长上升子序列.md
@@ -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++) {