1

我当前读取整数直到输入-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))
4

1 回答 1

0

由于current[-1]是以前的数字,您可以简单地更改:

if current and current[-1] % 2 != n % 2:

至:

if current and n % current[-1] == 0:

样本输入:

1
2
4
8
2
4
-1

会输出:

4
于 2018-08-08T04:50:31.673 回答