【科学刷题】最长递增子序列(LIS)：从1维到3维

1 【1维】最长递增子序列

1.1 求LIS长度

300. 最长递增子序列

1.1.1 $n^2$ 时间复杂度

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

1.1.2 $n\log n$ 时间复杂度

lower_bound

class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
        dp = [nums[0]]
        for num in nums[1:]:
            if num > dp[-1]:
                dp.append(num)
            else:
                l, r = 0, len(dp)
                while l < r:
                    mid = (l + r) // 2
                    if dp[mid] == num:
                        # l = mid + 1
                        r = mid
                    elif dp[mid] < num:
                        l = mid + 1
                    else:
                        r = mid
                dp[l] = num
        print(dp)
        return len(dp)

1.2 求LIS个数

673. 最长递增子序列的个数

class Solution:
    def findNumberOfLIS(self, nums: List[int]) -> int:
        n=len(nums)
        length=[0]*n
        count=[1]*n
        for j in range