先来一个O(n2)版本的
class Solution(object):
def lengthOfLIS(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
if len(nums) == 0:
return 0
temp = [1] * len(nums)
for i in range(len(nums)):
for j in range(i):
if nums[j] < nums[i]:
temp[i] = max(temp[i], temp[j]+1)
return max(temp)
O(nlogn)
举个例子,输入为[1,4,6,2,3,5]:
-读到1,将其追加到解集中;
-读到4,将其追加到解集中,解集变为[1,4];
-读到6,将其追加到解集中,解集变为[1,4,6];
-读到2,用其替换解集中的4,解集变为[1,2,6];
-读到3,用其替换解集中的6,解集变为[1,2,3];
-读到5,将其追加到解集中,解集变为[1,2,3,5],得到答案为解集长度4。
class Solution(object):
def lengthOfLIS(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
if len(nums) == 0:
return 0
temp = []
for i in nums:
if temp == [] or i > temp[-1]:
temp.append(i)
else:
index = self.binarySearch(temp, i)
temp[index] = i
return len(temp)
def binarySearch(self, array, m):
if len(array) == 0:
return 0
l, r = 0, len(array) - 1
while l < r:
mid = (l + r) >> 1
if array[mid] == m:
return mid
elif array[mid] < m:
l = mid + 1
else:
r = mid
return l