LeetCode 396. Rotate Function C++

396. Rotate Function

Given an array of integers A and let n to be its length.

Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a “rotation function” F on A as follow:

F(k) = 0 * Bk[0] + 1 * Bk[1] + … + (n-1) * Bk[n-1].

Calculate the maximum value of F(0), F(1), …, F(n-1).

Note:
n is guaranteed to be less than 105.

Example:

A = [4, 3, 2, 6]

F(0) = (0 * 4) + (1 * 3) + (2 * 2) + (3 * 6) = 0 + 3 + 4 + 18 = 25
F(1) = (0 * 6) + (1 * 4) + (2 * 3) + (3 * 2) = 0 + 4 + 6 + 6 = 16
F(2) = (0 * 2) + (1 * 6) + (2 * 4) + (3 * 3) = 0 + 6 + 8 + 9 = 23
F(3) = (0 * 3) + (1 * 2) + (2 * 6) + (3 * 4) = 0 + 2 + 12 + 12 = 26

So the maximum value of F(0), F(1), F(2), F(3) is F(3) = 26.

Approach

1. 这是一道找规律题，直接模拟暴力解肯定不行，题目大意很明显就不重述了，一开始这道我想了特别久，实在想不出除了模拟还有什么办法，最后看了大神的播客才明白是规律题，规律是F(i)=F(i-1)+sum-N*A[N-i],F(0)直接可以算出来，然后就可以推出后面的解，可是大神播客没写怎么找出来了的，这可能就是做题的直觉，然后再不断尝试就有灵感了。

Approach

class Solution {
public:
    int maxRotateFunction(vector<int>& A) {
        if (A.size() == 0)return 0;
        int N = A.size(), sum = 0, t = 0;
        for (int i = 0; i < N; i++) {
            t += i*A[i];
            sum += A[i];
        }
        int  maxn = t;
        for (int i = 1; i < N; i++) {
            t = t + sum - N*A[N - i];
            maxn = max(t, maxn);
        }
        return maxn;
    }
};