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.

思路：可视化之后，发现F(0),F(1),F(2),F(3)之间是有关系的，第一个F(0)算出来之后，之后所有的值都可以用之前值推导出来，F(1) = F(0) + sum - 4×A[A.length-i],这里的4就是A的长度，然后注意int的最大值最小值问题，一律转换成long来求解就可以了。所有的变量也要是long就可以了。另外，max一定要赋值成Long.MIN_VALUE; 扫描两遍O(n).

public class Solution {
    public int maxRotateFunction(int[] A) {
        if(A == null || A.length == 0) return 0;
        long[] dp = new long[A.length];
        long max = Long.MIN_VALUE;
        long sum = 0;
        for(int i=0; i<A.length; i++){
            dp[0] += i*A[i];
            sum += A[i];
        }
         max = Math.max(max,dp[0]);
        
        for(int i=1; i<A.length; i++){
            dp[i] = dp[i-1]+sum- A.length*A[A.length-i];
            max = Math.max(max, dp[i]);
        }
        return (int)max;
    }
}

思路：刚试了一下，好像用int也可以过。不过，我觉得面试的时候，还是提一下，如果sum大于了Integer.MAX_VALUE，还是需要用Long好点；

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