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.

0-A.length 循环乘一遍找一个最大的，

规律：先算出i*nums[i]的和，nums[i]*（i+1） 减去len*nusm[len-1](每个循环的最后一个数) 得到一个和。

1、首先所有值都加一个自身，也就是和加上count(i*nums[i])
2、扣除1中多加的最后一个，以及原来就应该减掉的n个了，减掉A[n-i]*n就好

public class Solution {
    public int maxRotateFunction(int[] nums) {
        if(nums==null||nums.length==0) return 0;
       int max=0;
       int count=0;
       int squ=0;
       for(int i=0;i<nums.length;i++){
           count+=nums[i];
           squ+=nums[i]*i;
       }
       max=squ;
       for(int i=0;i<nums.length;i++){
           squ+=count-nums.length*nums[nums.length-i-1];
           max=Math.max(squ,max);
       }
       return max;
    }
}