Python | Leetcode Python题解之第396题旋转函数
题目：
题解：
class Solution:
def maxRotateFunction(self, nums: List[int]) -> int:
f, n, numSum = 0, len(nums), sum(nums)
for i, num in enumerate(nums):
f += i * num
res = f
for i in range(n - 1, 0, -1):
f = f + numSum - n * nums[i]
res = max(res, f)
return res