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.
给一个数组,计算a[0]*0+a[1]*1+...,然后旋转一位得到新数组计算a[0]*0+a[1]*1+...,旋转n次后求最大值。如果每次都重新运算,可能会超时(没试过,猜的),观察可以发现每次运算可用到上次运算的结果。旋转之后,除了当前的最后一位,每一位都相当于多加了一份,减去最后一位的值就可以得到当前的值。
代码:
class Solution {
public:
int maxRotateFunction(vector<int>& A) {
int sum = 0, n = A.size(), val = 0;
for(int i = 0; i < n; ++i) {
sum += A[i];
val += A[i] * i;
}
int ans = val;
for(int i = 0; i < n; ++i) {
val += sum;
val -= A[n-i-1] * n;
ans = max(val, ans);
}
return ans;
}
};