python学习之编写函数查找给定序列的最长递增子序列

from itertools import combinations
def subAscendingList(lst):
    for length in range(len(lst), 0, -1):
        for sub in combinations(lst, length):
            if list(sub) == sorted(sub):
                return sub

lst = [61, 6, 8, 43, 31, 42, 55, 61, 69, 81]
print(lst)
print(subAscendingList(lst))