LeetCode 396: Rotate Function (Python3)

最新推荐文章于 2022-07-07 14:35:55 发布

KRummy

最新推荐文章于 2022-07-07 14:35:55 发布

阅读量321

点赞数

分类专栏： LeetCode Python3题解文章标签： LeetCode Python

本文链接：https://blog.csdn.net/qq_40655270/article/details/80767396

版权

LeetCode Python3题解专栏收录该内容

2 篇文章 0 订阅

订阅专栏

题目

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 \times B k [0] + 1 \times B k [1] + \dots + (n - 1) \times B k [n - 1]

$F(k)=0\times B_k[0] + 1 \times B_k[1] + \cdots +(n-1)\times B_k[n-1]$

Calculate the maximum value of F(0), F(1), …, F(n-1).

思路

错位相减即可。
得到递推公式： $F(k)-F(k-1)=\sum A - n \times A[n-k]$
使用这个递推公式就可在O(n)时间内完成计算。

代码

class Solution(object):
    def maxRotateFunction(self, A):
        """
        :type A: List[int]
        :rtype: int
        """
        n = len(A)
        sm = sum(A)
        F = sum([i * A[i] for i in range(n)]) # F0
        maxF = F
        for k in range(1, n):
            F = F + sm - n * A[n - k]
            maxF = max(maxF, F)
        return maxF