leetcode-300 最长上升子序列 Python

方法一：动态规划

class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
        if not nums:
            return 0
        dp = []
        for i in range(len(nums)):
            dp.append(1)
            for j in range(i):
                if nums[j]<nums[i]:
                    dp[i] = max(dp[i], dp[j]+1)
        return max(dp)```

方法二：贪心+二分查找

```python
class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
        d =[]
        for n in nums:
            if not d or n > d[-1]:
                d.append(n)
            else:
                l, r = 0, len(d)-1
                loc = r
                while l <= r:
                    mid = (l+r)//2
                    if d[mid] >= n:
                        loc = mid
                        r = mid - 1
                    else:
                        l = mid + 1
                d[loc] = n
        return len(d)