LeetCode396 Rotate Function

最新推荐文章于 2025-10-12 23:45:01 发布

原创最新推荐文章于 2025-10-12 23:45:01 发布 · 338 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode

本文介绍了一种针对数组旋转后求特定函数最大值的问题及解决方案。对于长度为n的整数数组A，通过定义旋转函数F(k)，计算不同旋转步数下函数F(k)的最大值。示例中给出了具体计算过程，并提供了一个Java实现方法。

题目要求:
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.

算法的最大的问题是:计算复杂度太高 O(n^2)

public class Solution {
    public int maxRotateFunction(int[] A) {
        int num = A.length;
        if(num == 0) return 0;
        int[] arr = new int[num];
        int flag = 0;

        for(int x : A) {
            for(int i = 0; i < num; i++) {
                if(i + flag < num) arr[i] += (i + flag) * x;
                else arr[i] += (i + flag - num) * x;
            }
            flag++;
        }
        Arrays.sort(arr);
        return arr[num - 1];
    }
}