[LeetCode]--396. Rotate Function

最新推荐文章于 2025-12-18 17:00:31 发布

杜鲁门

最新推荐文章于 2025-12-18 17:00:31 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode LeetCode算法分析文章标签： leetcode Rotate 数组算法算法

本文链接：https://blog.youkuaiyun.com/bug_moving/article/details/52839256

LeetCode算法分析同时被 2 个专栏收录

115 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

126 篇文章

订阅专栏

给定一个整数数组A，其长度为n，定义一个旋转函数F，它计算F(0), F(1), ..., F(n-1)的最大值。例如，对于数组[1,2,3,4]，F(3) = 26。通过分析F(k)的规律，可以找到求解最值的方法。" 108257835,9228493,Scala编程：深入理解变量、数据类型与类型转换,"['Scala编程', '强类型语言', '类型转换', '变量声明']

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.

了解本专栏