leetcode RotateFunction
z
 2019-04-09 10:36:27   
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
public class RotateFunction {
  public int maxRotateFunction(int[] A) {
    int sum=0;
    int b = 0;
    int f=0;
    for (int i: A){
      sum += i;
      f += i * b;
      b += 1;
    }
    int max = f;
    for (int i=1; i<A.length; i++){
      int ff = f + sum - A.length * A[A.length-i];
      f = ff;
      max = Math.max(max, ff);
    }
    return max;
  }
}