解题思路:
一道非常简单的数学逻辑推理题,简单来说就是找规律,每两个连续的F相减,总会有F(i)-F(i-1)=sum+n*nums[n-i],所以依据这条规律,只要把F(0)计算出来,后面的就都直接出来了,根本无需暴力遍历,代码如下:
class Solution {
public:
int maxRotateFunction(vector<int>& nums) {
int n = nums.size();
int sum = 0, F = 0;
for(int i = 0; i < n; i ++) {
sum += nums[i];
F += i * nums[i];
}
int maxSum = F;
for(int i = 1; i < n; i ++) {
F = F + sum - n * nums[n - i];
maxSum = max(maxSum, F);
}
return maxSum;
}
};