Question:codility Lesson5 MinAvgTwoSlice
My answer:
def solution(A):
min_avg = (A[0] + A[1])/2.0
avg_pos = 0
for i in xrange(1,len(A) - 2):
if (A[i] + A[i + 1]) / 2.0 < min_avg:
min_avg = (A[i] + A[i + 1]) / 2.0
avg_pos = i
if (A[i] + A[i + 1] + A[i + 2]) / 3.0 < min_avg:
min_avg = (A[i] + A[i + 1] + A[i + 2]) / 3.0
avg_pos = i
if (A[-1] + A[-2]) / 2.0 < min_avg:
min_avg = (A[-1] + A[-2])
avg_pos = len(A) - 2
return avg_pos