mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 20:40:39 +08:00
Update 0300.最长上升子序列.md
result should be initialized to 1.
This commit is contained in:
@ -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]:
|
||||||
|
Reference in New Issue
Block a user