Problem

Given an integer array nums, return the length of the longest strictly increasing

subsequence

.

Example 1:

1
2
3
4
Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.

Example 2:

1
2
3
Input: nums = [0,1,0,3,2,3]
Output: 4

Example 3:

1
2
3
Input: nums = [7,7,7,7,7,7,7]
Output: 1

Constraints:

  • 1 <= nums.length <= 2500
  • 104 <= nums[i] <= 104

Follow up: Can you come up with an algorithm that runs in O(n log(n)) time complexity?

Solve

1
2
3
4
5
6
7
8
9
10
11
class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
        dp = [1]*(len(nums)+1)

        for i in range( len(nums) ):
            for j in range(i):
                if nums[j] < nums[i]:
                    dp[i] = max( dp[i] , dp[j] + 1 )
        
        return max(dp)

寫的時候1次過，嘿嘿(,,・ω・,,)