LIS(Longest Increasing Subsequence)问题是指给定一个序列,求其中最长的单调递增子序列的长度。
例如,对于序列 [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5],最长的单调递增子序列为 [1, 2, 3, 5, 5],长度为 5。
LIS 问题可以使用动态规划算法解决,时间复杂度为 O ( n 2 ) O(n^2) O(n2),也可以使用二分查找算法优化时间复杂度至 O ( n log n ) O(n \log n) O(nlogn)
动态规划:
def lis(nums):
n = len(nums)
dp = [1] * n
for i in range(n):
for j in range(i):
if nums[j] < nums[i]:
dp[i] = max(dp[i], dp[j]+1)
return max(dp)
贪心 + 二分法
def bisect_left(nums, target):
l, r = 0, len(nums)
while l < r:
mid = (l + r) // 2
if nums[mid] < target:
l = mid + 1
else:
r = mid
return l
def lis(nums):
n = len(nums)
tails = [nums[0]]
for i in range(1, n):
if nums[i] > tails[-1]:
tails.append(nums[i])
else:
pos = bisect_left(tails, nums[i])
tails[pos] = nums[i]
return len(tails)