C++ 解法, 执行用时: 134ms, 内存消耗: 528K, 提交时间: 2022-02-18 19:03:05

#include<bits/stdc++.h>
using namespace std;
int n,x,t,y;
int main(){
	scanf("%d",&n);
	scanf("%d",&x);
	y=x+1;
	for (int i=1;i<n;i++){
		scanf("%d",&t);
		x=max(__gcd(x,t),__gcd(x,t+1));
		y=max(__gcd(y,t),__gcd(y,t+1));
	}
	printf("%d\n",max(x,y));
}

Python3 解法, 执行用时: 545ms, 内存消耗: 122444K, 提交时间: 2022-02-26 22:00:20

n=int(input())
list_in=list(map(int,input().split()))
min_=min(list_in)+1
for i in range(min_,0,-1):
    flag=1
    for j in list_in:
        if j%i!=0 and (j+1)%i!=0:
            flag=0
            break
    if flag:
        print(i)
        break