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

janeyziqinglin · web-flow · commit f80761a43833 · 2023-05-02T23:34:57.000-04:00
result should be initialized to 1.
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]:
