最长上升子序列
def lengthOfLIS(self, nums):
if len(nums) <= 1:
return len(nums)
mem = [1 for _ in range(len(nums))]
for j in range(1, len(nums)):
for i in range(j):
if nums[i] < nums[j]:
mem[j] = max(mem[j], mem[i] + 1)
return max(mem)
Processed:
0.015, SQL:
10
