算法导论第3版 4.1-5

    the_art_of_now_list = []
    the_temper_list =[]
    A=[1,2,3,4,5,6,9,2,3,4,6,7,9,10,11,9,99,100,101,102,103,104,105,107]
    for i in range(len(A)-1):
        if A[i]<A[i+1]:
            if i==0:
                the_temper_list.append(A[i])
                the_temper_list.append(A[i+1])
            else:the_temper_list.append(A[i+1])
            if len(the_art_of_now_list) < len(the_temper_list):
                the_art_of_now_list = copy.deepcopy(the_temper_list)

        else:
            the_temper_list.clear()
            the_temper_list.append(A[i+1])
    print(the_art_of_now_list)

[9, 99, 100, 101, 102, 103, 104, 105, 107]

非递归,遍历N-1次N为数组长度,运行时间为O(n)