题解 | 游游的最长稳定子数组
游游的最长稳定子数组
https://www.nowcoder.com/practice/ea7098b7960348f6915e252f0c4debcc
import sys
n = int(input())
a = list(map(int,input().split()))
l = 0
max_len = 0
for r in range(1,n):
if abs(a[r]-a[r-1])>1 or r==n-1:
if r==n-1:
cur_len = r-l+1
else:
cur_len = r-l
max_len = max(max_len,cur_len)
l = r
print(max_len)
查看12道真题和解析