python实现求最长连续数字递增子串长度

# !/usr/bin/python3
# -*- coding: utf-8 -*-
"""
@Author         :  JHC
@Version        :  
------------------------------------
@File           :  ScrapyProject/test111.py
@Description    :  JHC 
@CreateTime     :  2021/12/29 19:20
------------------------------------
@ModifyTime    

史上最傻逼的暴力枚举法，也是没刷过算法题情况下，面试中第一个能想到的办法 :  
"""
def find(arr):
    lis2 = []
    for i in range(0,len(arr)):
        lis = []
        lis.append(arr[i])
        # print('-'*100)
        # print('a[i] = ', arr[i])
        for k in range(len(arr)):
            for j in range(0,len(arr)):
                # print('a[j] = ',arr[j])
                if arr[j] == arr[i] + 1:
                    # print('arr[j] = ',arr[j])
                    # arr[i] = arr[j]
                    # i+=1
                    lis.append(arr[j])
            lis2.append(len(lis))
        # print('len(lis) = ',len(lis))

    print('最长子串长度为:',sorted(lis2)[-1])





if __name__ == '__main__':
    arr = [8,13,12,1,7,4,3,8,9,2,11,10,6]
    find(arr)