[leetcode] 396. Rotate Function 解题报告
2016-10-09 09:15
363 查看
题目链接:https://leetcode.com/problems/rotate-function/
Given an array of integers
Assume
be an array obtained by rotating the array
we define a "rotation function"
follow:
Calculate the maximum value of
Note:
n is guaranteed to be less than 105.
Example:
思路:根据F[0],F[1],F[2],F[3]的规律可知F[1] = F[0] + sumOf(A) - 4*A[3]; 依次类推.
代码如下:
class Solution {
public:
int maxRotateFunction(vector<int>& A) {
int len = A.size(), sum1 = 0, sum2 = 0, ans = INT_MIN;
for(int i = 0; i < len; i++) sum1 += A[i], sum2 += i*A[i];
ans = sum2;
for(int i = 1; i < len; i++)
{
sum2 = sum2 + sum1 - len*A[len-i];
ans = max(sum2, ans);
}
return ans;
}
};
Given an array of integers
Aand let n to be its length.
Assume
Bkto
be an array obtained by rotating the array
Ak positions clock-wise,
we define a "rotation function"
Fon
Aas
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[0],F[1],F[2],F[3]的规律可知F[1] = F[0] + sumOf(A) - 4*A[3]; 依次类推.
代码如下:
class Solution {
public:
int maxRotateFunction(vector<int>& A) {
int len = A.size(), sum1 = 0, sum2 = 0, ans = INT_MIN;
for(int i = 0; i < len; i++) sum1 += A[i], sum2 += i*A[i];
ans = sum2;
for(int i = 1; i < len; i++)
{
sum2 = sum2 + sum1 - len*A[len-i];
ans = max(sum2, ans);
}
return ans;
}
};
相关文章推荐
- [Leetcode] 396. Rotate Function 解题报告
- LeetCode 396. Rotate Function 解题报告
- Leetcode 396. Rotate Function 旋转方程 解题报告
- 【LeetCode】376.Wiggle Subsequence(Medium)解题报告
- LeetCode: Populating Next Right Pointers in Each Node II 解题报告
- 【LeetCode】693. Binary Number with Alternating Bits 解题报告
- LeetCode 409. Longest Palindrome 解题报告
- 【LeetCode】Assign Cookies 解题报告
- [leetcode] 454. 4Sum II 解题报告
- [Leetcode] 474. Ones and Zeroes 解题报告
- [Leetcode] 330. Patching Array 解题报告
- 【LeetCode】235.Lowest Common Ancestor of a Binary Search Tree(Easy)解题报告
- 【LeetCode】Set Matrix Zeroes 解题报告
- 【MySQL】【leetcode】 Second Highest Salary解题报告
- [leetcode] 280. Wiggle Sort 解题报告
- LeetCode 新题: Find Minimum in Rotated Sorted Array II 解题报告-二分法模板解法
- Leetcode 399 python 解题报告
- [Leetcode] 746. Min Cost Climbing Stairs 解题报告
- 【LeetCode】Search in Rotated Sorted Array 解题报告
- LeetCode(292) Nim Game解题报告