LeetCode 396. Rotate Function

Rotate Function

Medium

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.

思路

F(k+1) - F(k) = (n - 1) A[k] - (A[0] + A[1] + ... + A[k-1] + A[k+1] + ... + A[n-1]) = sum(A) - n * A[k]

求出F(0)，用上述递推式遍历F(k)取最大，O(n)时间复杂度算法

代码

class Solution {
    public int maxRotateFunction(int[] A) {
        int i = 0, n = A.length, ans = Integer.MIN_VALUE, b = 0, s = 0;
        for (i=0; i<n; ++i) {
            b += i * A[i];
        }
        ans = Math.max(b, ans);
        for (int a: A) {
            s += a;
        }
        for (i=0; i<n-1; ++i) {
            b += n * A[i] - s;
            ans = Math.max(b, ans);
        }
        return ans;
    }
}