396. Rotate Function
来源:互联网 发布:淘宝女鞋店铺排行榜 编辑:程序博客网 时间:2024/05/14 05:07
Q:
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 = 25F(1) = (0 * 6) + (1 * 4) + (2 * 3) + (3 * 2) = 0 + 4 + 6 + 6 = 16F(2) = (0 * 2) + (1 * 6) + (2 * 4) + (3 * 3) = 0 + 6 + 8 + 9 = 23F(3) = (0 * 3) + (1 * 2) + (2 * 6) + (3 * 4) = 0 + 2 + 12 + 12 = 26So the maximum value of F(0), F(1), F(2), F(3) is F(3) = 26.
A:
Consider we have an Array containing 5 items A,B,C,D,E.
According to the problem statement
F(0) = (0A) + (1B) + (2C) + (3D) + (4E)
F(1) = (4A) + (0B) + (1C) + (2D) + (3E) = F(0) - (A + B + C + D + E) + (5A)
F(2) = (3A) + (4B) + (0C) + (1D) + (2E) = F(1) - (A + B + C + D + E) + (5B)
......
We can easily get the following conclusion:
F(0) = (0A) + (1B) + (2C) + (3D) + (4E)
F(n) = F(n-1) - (A + B + C + D + E) + (5*Array[n-1])
C:
var maxRotateFunction = function(A) {
var sumA = A.reduce(function (prev, cur) {
return prev + cur;
}, 0);
var prevRotationSum = A.reduce(function (prev, cur, index) {
return prev + cur * index;
}, 0);
var maxSum = prevRotationSum;
for(var i = 1; i < A.length ; ++i) {
prevRotationSum += (A.length * A[i-1] - sumA);
maxSum = Math.max(prevRotationSum, maxSum);
}
return maxSum;
};
var sumA = A.reduce(function (prev, cur) {
return prev + cur;
}, 0);
var prevRotationSum = A.reduce(function (prev, cur, index) {
return prev + cur * index;
}, 0);
var maxSum = prevRotationSum;
for(var i = 1; i < A.length ; ++i) {
prevRotationSum += (A.length * A[i-1] - sumA);
maxSum = Math.max(prevRotationSum, maxSum);
}
return maxSum;
};
0 0
- 396. Rotate Function
- 【Leetcode】396. Rotate Function
- [LeetCode]396. Rotate Function
- 396. Rotate Function
- 396. Rotate Function
- LeetCode 396. Rotate Function
- 396. Rotate Function
- 396. Rotate Function
- 396. Rotate Function
- [leetcode]396. Rotate Function
- 396. Rotate Function
- [LeetCode]--396. Rotate Function
- 396. Rotate Function
- leetcode 396. Rotate Function
- [LeetCode] 396. Rotate Function
- 396. Rotate Function
- 396. Rotate Function (python)
- 396. Rotate Function
- C语言编写猜数字小游戏
- 算法篇之递归--八皇后
- Activity的启动和创建
- 工作流系统之三十八 工作流软件中的定时器处理
- poj 1125 图论最短路变形题
- 396. Rotate Function
- saiku限制日期查询
- 工作流系统之三十九 利用工作流引擎给业务系统建模
- OpenCV2.4.13+VS2012开发环境配置
- LeetCode oj 349. Intersection of Two Arrays(HashSet)
- 如何在Mac OS 10.11 El Capitan上使用通用USB 2.0 10 / 100M以太网适配器RD9700
- 关于计算机精度的一个小问题
- Android 直播点赞(飘❤)
- 工作流系统之四十 抄送功能的实现