边工作边刷题：70天一遍leetcode: day 19

Longest INc

要点：

class Solution(object):
    def lengthOfLIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums: return 0
        maxLen = 1
        n = len(nums)
        dp = [1 for i in range(n)]
        dp[0]=1
        for i in range(1,n):
            for j in range(i):
                if nums[i]>nums[j]:
                    if dp[j]+1>dp[i]:
                        dp[i]=dp[j]+1
            
            if dp[i]>maxLen:
                maxLen = dp[i]
        
        return maxLen