求最长上升子序列的长度

题目叙述：

class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
        length = len(nums)
        if length == 0:
            return 0
        result = [1] * length
        for i in range(1,length):
            for j in range(0,i):
                if nums[j]<nums[i] and (result[j]+1) > result[i]:
                    result[i] = result[j] + 1                  
        return max(result)