描述:
输入一个乱序的连续数列,,输出其中最长连续数列长度,要求算法复杂度为O(n).
输入:
54,55,300,12 1 5,4,3,2,1 1,2,3,4,5,6
输出:
4 2 1 5 6
思路:
输入字符串以逗号分隔数字,将字符串类型通过list,map转化为整形。并通过sort()函数进行排序。确定两个变量l,r分别像两个方向检索连续的数字,最终length=l+r+1;通过while循环遍历检测连续。
代码:
import sys
for line in sys.stdin:
line = line.strip().split(',')
data = list(map(int,line))
data.sort()
length = 0
for x in data:
l = r = 0
num1 = num2 = x
flag_l = flag_r = True
while flag_l:
if num1-1 in data:
l = l+1
num1 = num1-1
else:
flag_l = False
while flag_r:
if num2+1 in data:
r = r+1
num2 = num2+1
else:
flag_r = False
if length<(l+r+1):
length = l+r+1
print(length)