396. 旋转函数

解法一：暴力 超时

解法二：根据规律

class Solution {
    public int maxRotateFunction(int[] nums) {
        int len = nums.length;
        int sum = 0;
        int max = 0;
        int temp = 0;
        for(int i=0;i<len;i++){
            sum = sum + nums[i];
            temp = temp + i * nums[i];
        }
        max = temp;
        for(int i=1;i<len;i++){
            temp = temp + sum - len * nums[len-i];
            max = Math.max(max,temp);
        }
        return max;
    }

}