题意:给出一个数组a,长度为n
其中f(0)=0*a[0]+1*a[1]+...+(n-1)*a[n-1]
f(1)=0*a[n-1]+1*a[0]+...+(n-1)*a[n-2]
...
f(n-1)=0*a[1]+1*a[2]+...+(n-1)*a[0]
求f(0),f(1)...,f(n-1)的最大值
思路:
f(0)-f(1)=(n-1)*a[n-1] - a[0]-a[1]-...-a[n-2],则有f(0)-f(1)= n*a[n-1]-(a[0]+a[1]+...+a[n-1]
f(1)-f(2)=(n-1)*a[n-2]-a[n-1]-a[0]-a[1]-...-a[n-3],则有f(1)-f(2)=n*a[n-2] -(a[0]+a[1]+...+a[n-1])
以此类推有f(n-2)-f(n-1)=n*a[1]-(a[0]+a[1]+..+a[n-1])
具体代码如下:
public class Solution {
public int maxRotateFunction(int[] A)
{
int f = 0, sum = 0, size = A.length;
for (int i = 0; i < size; i++)
{
f += i * A[i];
sum += A[i];
}
int ans = f;
for (int i = size - 1; i >= 0; i--)
{
f = f + sum - size * A[i];
ans = Math.max(ans, f);
}
return ans;
}
}