45 leetcode - Rotate Function

最新推荐文章于 2024-06-14 05:44:12 发布

忧桑的小兔子

最新推荐文章于 2024-06-14 05:44:12 发布

阅读量218

点赞数

文章标签： leetcode Python 算法 rotate function

本文链接：https://blog.csdn.net/lis_12/article/details/53725912

版权

算法专栏收录该内容

84 篇文章 0 订阅

订阅专栏

#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
 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(n)->F(n+1)
'''
class Solution(object):
    def maxRotateFunction(self, A):
        """
        :type A: List[int]
        :rtype: int
        """
        length = len(A)
        if length <= 0:
            return 0

        A_sum = 0
        fun_sum = 0
        max_sum = 0
        for index,val in enumerate(A):
            A_sum += val
            fun_sum += index * val

        max_sum = fun_sum
        while index > 0:
            #利用F(i)->F(i+1),F(i+1) = F(i) - (length - 1) * A[index] + A_sum - A[index]
            fun_sum = fun_sum - (length - 1) * A[index] + A_sum - A[index]
            if fun_sum > max_sum:
                max_sum = fun_sum
            index -= 1

        return max_sum

if __name__ == "__main__":
    s = Solution()
    print s.maxRotateFunction([4,3,2,6])