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

result should be initialized to 1.
lilian-r · May 3, 2023 · f80761a · f80761a
1 parent f7e280e
commit f80761a
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/problems/0300.最长上升子序列.md b/problems/0300.最长上升子序列.md
@@ -149,7 +149,7 @@ class Solution:
         if len(nums) <= 1:
             return len(nums)
         dp = [1] * len(nums)
-        result = 0
+        result = 1
         for i in range(1, len(nums)):
             for j in range(0, i):
                 if nums[i] > nums[j]: