我当前读取整数直到输入-1并检查偶数/奇数/偶数的最长模式的当前代码如何修改以检查前一个数字是当前数字的除数的最长连续序列。
代码:
longest=[]
current=[]
while True:
n = int(input())
if n == -1:
break
if current and current[-1] % 2 != n % 2:
current.append(n)
else:
current = [n]
if len(current) > len(longest):
longest = current
print(len(longest))
最近的尝试:代码:
longest=[]
current=[]
while True:
n = int(input())
if n == -1:
break
if current % current[-1] == 0:
current.append(n)
else:
current = [n]
if len(current) > len(longest):
longest = current
print(len(longest))