Leetcode 396. Rotate Function

Problem

You are given an integer array nums of length n.
Assume arrk to be an array obtained by rotating nums by k positions clock-wise. We define the rotation function F on nums as follow:

• F(k) = 0 * arrk[0] + 1 * arrk[1] + … + (n - 1) * arrk[n - 1].
  Return the maximum value of F(0), F(1), …, F(n-1).

The test cases are generated so that the answer fits in a 32-bit integer.

Algorithm

$$F(0)=0\cdot a[0]+1\cdot a[1]+2\cdot a[2]+\cdots +(n-1)\cdot a[n-1]$$
$$F(1)=0\ast a[n-1]+1\ast a[0]+...+(n-1)\ast a[n-2]=F(0)-n\ast a[n-1]+\sum _{i=1}^{n}a[i].$$
so we have:
$$F(k)=F(k-1)-n\ast a[n-k]+\sum _{i=1}^{n}a[i].$$

Code

class Solution:
    def maxRotateFunction(self, nums: List[int]) -> int:
        sum_n, f_i, l_num = 0, 0, len(nums)
        for i in range(l_num):
            sum_n = sum_n + nums[i]
            f_i = f_i + i * nums[i]
        
        f_max = f_i
        for i in range(1, l_num):
            f_i = f_i + sum_n - l_num * nums[l_num-i]
            if f_max < f_i:
                f_max = f_i
        
        return f_max