我的解决方案:def best_sequence_length(arr):
'''Find length of the longest ascending sequence in an array'''
arr_length = len(arr)
if arr_length <= 1:
return arr_length
longest = [1] # will store the lengths of the longest sequence ending on this index
best_idx_at_all = 0
for idx in range(1, arr_length):
best_len_so_far = 1
back = -1
for i in range(len(longest)+1):
if arr[i] < arr[idx] and best_len_so_far <= longest[i]:
best_len_so_far = longest[i] + 1
back = i
longest.append(longest[back]+1 if back > -1 else 1)
if longest[best_idx_at_all] < longest[idx]:
best_idx_at_all = idx
return longest[best_idx_at_all]
这可能不是很“python”(它类似于C甚至FORTRAN代码:-),但它的复杂性为O(n^2)。在
如果您想获得最长的序列本身,而不仅仅是它的长度(这可能是不明确的),那么上面的函数只需要稍作修改:
^{pr2}$