旋转数组迭代

旋转数组：

给定一个长度为 n 的整数数组 nums 。

假设 arrk 是数组 nums 顺时针旋转 k 个位置后的数组，我们定义 nums 的 旋转函数 F 为：

F(k) = 0 * arrk[0] + 1 * arrk[1] + … + (n - 1) * arrk[n - 1]
返回 F(0), F(1), …, F(n-1)中的最大值 。

生成的测试用例让答案符合 32 位 整数。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/rotate-function

输入: nums = [4,3,2,6]
输出: 26
解释:
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
所以 F(0), F(1), F(2), F(3) 中的最大值是 F(3) = 26 。

//旋转函数化简：F(k-1) = 0 * arrk[0] + 1 * arrk[1] + ... + (n - 1) * arrk[n - 1]
//F(k) = F(k-1) + ...+ arrk[0]+arrk[1]+arrk[2]+ +...  - n * arrk[n-1]
//F(k) = F(k-1) + nums之和 - n * arrk[n-1]
//通过迭代计算出F(k)并计算出其中最大值
public class MaxRotateFunction {

    public static int maxRotateFunction(int[] nums) {
        /*int n = nums.length;
        List<Integer> or = Arrays.stream(nums).boxed().collect(Collectors.toList());
        List<Integer> fhs = new ArrayList<>(n);
        for (int i = 0; i < n; i++) {
            Integer f = 0;
            for (int j = 0; j < n; j++) {
                f += j * or.get(j);
            }
            fhs.add(f);
            int a = or.get(0);
            or.remove(0);
            or.add(a);
        }
        return Collections.max(fhs);*/
        int f = 0, n = nums.length, numSum = Arrays.stream(nums).sum();
        for (int i = 0; i < n; i++) {
            f += i * nums[i];
        }
        int res = f;
        for (int i = n - 1; i > 0; i--) {
            f += numSum - n * nums[i];
            res = Math.max(res,f);
        }
        return res;
    }

    public static void main(String[] args) {
        int[] nums = {-56,-66,-60,-76,-20,51,-91,-2,-20,33,39,97,-95,-95,-18,-32,-54,-60,41,85,25,-14,-34,-4,37,71,75,-63,4,6,69,-44,54,-26,59,25,34,-17,-22,58,8,10,-39,21,37,-40,99,-90,98,-30,87,-11,-8,-37,79,6,-63,97,-62,96,7,-92,46,35,-22,49,-29,20,71,-81,-72,77,30,28,61,85,-35,47,20,12,-4,68,-19,69,-2,-35,-68,-3,31,93,35,8,25,44,60,49,35,-15,-50,40,67,-63,-84,92,-100,68,-14,72,-15,73,-35,-85,-32,-25,-7,66,-66,-80,-94,42,-81,65,76,37,89,15,68,6,-40,10,39,-34,26,34,-56,-64,8,-26,75,63,18,-28,82,-82,50,-48,80,-57,46,-89,-63,71,-71,-1,-63,-63,19,9,-15,-73,52,-36,29,-68,60,-98,63,-79,-98,15,32,-13,-9,-27,-88,-76,-30,44,-76,69,-81,16,29,-95,-65,18,78,-62,-48,86,87,23,-25,6,59,-84,11,14,97,6,90,56,-83,-52,63,6,-25,79,22,97,-14,59,52,-52,18,90,59,20,-21,57,74,-63,93,30,-65,-1,39,77,46,58,54,60,-18,-82,-33,16,17,-87,29,-90,-80,-5,-20,-6,17,67,-63,13,-75,-49,-9,-92,-22,-19,70,46,13,62,37,24,-37,49,-21,-15,39,75,54,-30,23,77,40,31,71,-59,-53,39,1,58,-74,23,-23,-71,-7,-90,82,-15,87,-61,10,8,82,24,60,41,-27,-42,0,61,52,41,-25,-66,28,-4,-37,71,-17,61,-85,2,13,30,-80,-91,-81,-89,27,5,-98,-24,85,-21,93,-40,91,45,-31,7,-52,87,44,60,-17,-36,-87,52,-46,-48,60,95,-54,-72,-33,27,-31,66,-82,78,94,-43,19,24,30,-73,-34,-22,-86,-46,82,-53,46,-89,-63,-13,81,69,-8,84,64,85,79,-62,38,-69,83,22,-36,63,-65,75,-27,-95,54,-83,54,-33,-49,51,-30,14,97,-60};
        System.out.println(maxRotateFunction(nums));
    }
}