版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u012494820/article/details/82667951
给定一个经过排序的数组arr,在其中寻找一个子数组,使得子数组由连续的整数构成。这段代码可以用于在数据中寻找连续的上升边沿。代码:
max_length = 0
max_sets = None
data_f = arr[0]
length_c = 1
sets_c = [arr[0]]
for data in arr[1:]:
# for repeated number
if data - data_f == 0:
continue
if data - data_f == 1:
length_c += 1
sets_c.append(data)
else:
if length_c > max_length:
max_sets = sets_c
max_length = length_c
length_c = 1
sets_c = [data]
data_f = data
具体参考 GitHub。
寻找连续上升边缘的方法也可以用于求解“最短未排序子数组”问题,代码:
# fore
order = 0
for idata in arr[1:]:
if idata > data:
data = idata
order += 1
continue
else:
break
pre_order = order
具体参考GitHub。