def Solution(N, li, M):
rear = 0 # 尾
front = int(rear) + int(M) - 1 # 头
su = []
for i in range(N):
sum = 0
if front <= N - 1:
for j in range(front):
sum += li[j]
su.append(sum)
rear += 1
front += 1
else:
break
print(su)
return max(su)
n = 6 # 数字个数
li = [1, 2, 3, 4, 5, 6] # 数字列表
m = 3 # 窗口大小
p = Solution(n, li, m)
print(p)
简单计算滑动窗口和的最大值