396. Rotate Function

LeetCode

• 题目地址：https://leetcode.com/problems/rotate-function/
• 解题思路：通过寻找F(k)和F(k-1)的关系，使得算法能在O(n)的复杂度中得出结果

F(k) = 0 * Bk[0] + 1 * Bk[1] + ... + (n-1) * Bk[n-1]
F(k-1) = 0 * Bk-1[0] + 1 * Bk-1[1] + ... + (n-1) * Bk-1[n-1]
       = 0 * Bk[1] + 1 * Bk[2] + ... + (n-2) * Bk[n-1] + (n-1) * Bk[0]
#1
F(k) - F(k-1) = Bk[1] + Bk[2] + ... + Bk[n-1] + (1-n)Bk[0]
              = (Bk[0] + ... + Bk[n-1]) - nBk[0]
              = sum - nBk[0]  //sum = sum(A)
#2
k = 0; B0[0] = A[0];
k = 1; B1[0] = A[len-1];
k = 2; B2[0] = A[len-2];
...

• 最终结合#1&#2可以在线性时间中算出结果，给出代码如下

class Solution {
public:
    int maxRotateFunction(vector<int>& A) {
        //cal sum(A) & F(0)
        int sum = 0;
        int curF = 0;
        int n = A.size();
        for (int i = 0; i < n; i++) {
            sum += A[i];
            curF += i * A[i];
        }
        //cal max
        int max = curF;
        for (int i = 1; i < n; i++) {
            curF = curF + sum - n * A[n - i];
            if (curF > max) {
                max = curF;
            }
        }
        return max;
    }
};