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

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

Browse Source 
result should be initialized to 1.
This commit is contained in:
JaneyLin
2023-05-02 23:34:57 -04:00
committed by GitHub
parent f7e280e7e2
commit f80761a438
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

@ -149,7 +149,7 @@ class Solution:
if len(nums) <= 1: if len(nums) <= 1:
return len(nums) return len(nums)
dp = [1] * len(nums) dp = [1] * len(nums)
result = 0 result = 1
for i in range(1, len(nums)): for i in range(1, len(nums)):
for j in range(0, i): for j in range(0, i):
if nums[i] > nums[j]: if nums[i] > nums[j]: