python程序的优化_python程序的优化

我试图在HackerRank上解决这个问题：Animesh has N empty candy jars numbered from 1 to N with infinite capacity. He performs M

operations. Each operation is described by 3 integers a, b and k where a and b are index of >the jars and k is the number of candies to be added inside each jar with index between a and >b (both inclusive). Can you tell the average number of candies after M operations?

I have written the below code in Python 3:def operate(a, b, k, array):

for i in range(a - 1, b):

array[i] += k

def mean(array):

return int(sum(array) / len(array))

splitinput = [int(x) for x in input().split()]

candy = []

for i in range(splitinput[0]):

candy.append(0)

for j in range(splitinput[1]):

splitinput2 = input().split()

operate(int(splitinput2[0]), int(splitinput2[1]), int(splitinput2[2]), candy)

print(mean(candy))

它可以工作，但在某些测试用例中超时。我该怎么做才能更快呢？我用Python编写代码已经有一段时间了，但是优化的细节仍然让我捉摸不透。在