Math-396-Rotate Function

最新推荐文章于 2024-09-18 20:33:32 发布

kevin聪

最新推荐文章于 2024-09-18 20:33:32 发布

阅读量259

点赞数 1

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/79209731

版权

算法与数据结构同时被 2 个专栏收录

569 篇文章 0 订阅

订阅专栏

leetcode

557 篇文章 12 订阅

订阅专栏

Description:
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.

Best Solution:

/*
*F(0) = 0*A[0]+1*A[1]+...(n - 2) * A[n - 2]+(n - 1)A[n - 1]
*F(1) = 1*A[0]+2*A[1]+...(n - 1) * A[n - 1]+0*A[n - 1] = F(0)+A[0]+A[1]
*+...A[n - 2]+A[n - 1]-A[n - 1]-(n - 1)A[n - 1]=F(0)+sum(A)-n*A[n-1]
*得出递推式F(k) = F(k - 1) + sum(A) - n * A[n - 1]
*/
class Solution {
    public int maxRotateFunction(int[] A) {
      int allSum = 0;
      int len = A.length;
      int F = 0;
      for (int i = 0; i < len; i++) {
        F += i * A[i];
        allSum += A[i];
      }
      int max = F;
      for (int i = len - 1; i >= 1; i--) {
        F = F + allSum - len * A[i];
        max = Math.max(F, max);
      }
      return max;  
    }
}