1
class Solution {
2
  public int maxRotateFunction(int[] nums) {
3
    int sum1 = 0, sum2 = 0;
4
    for (int i = 0; i < nums.length; i++) {
5
      sum1 += nums[i];
6
      sum2 += i * nums[i];
7
    }
8
    int result = sum2;
9
    for (int i = 0; i < nums.length; i++) {
10
      sum2 = sum2 - sum1 + (nums.length) * nums[i];
11
      result = Math.max(result, sum2);
12
    }
13
    return result;
14
  }
15
}