[LeetCode]396. Rotate Function
2017-03-13 16:18
239 查看
https://leetcode.com/problems/rotate-function/#/description
i是从后向前遍历的
F(1) = F(0) + sum - n * A[i]
public class Solution {
public int maxRotateFunction(int[] A) {
int sum = 0;
int rotate = 0;
for (int i = 0; i < A.length; i++) {
sum += A[i];
rotate += i * A[i];
}
int max = rotate;
for (int i = A.length - 1; i >= 0; i--) {
rotate = rotate + sum - A.length * A[i];
max = Math.max(max, rotate);
}
return max;
}
}
i是从后向前遍历的
F(1) = F(0) + sum - n * A[i]
public class Solution {
public int maxRotateFunction(int[] A) {
int sum = 0;
int rotate = 0;
for (int i = 0; i < A.length; i++) {
sum += A[i];
rotate += i * A[i];
}
int max = rotate;
for (int i = A.length - 1; i >= 0; i--) {
rotate = rotate + sum - A.length * A[i];
max = Math.max(max, rotate);
}
return max;
}
}
相关文章推荐
- LeetCode 396. Rotate Function
- [leetcode'396. Rotate Function
- LeetCode 396. Rotate Function
- [leetcode]396. Rotate Function
- Leetcode 396. Rotate Function (Easy) (cpp)
- 【LeetCode】 396. Rotate Function
- leetcode_396. Rotate Function ? 待解决
- leetcode 396. Rotate Function 旋转向量的计算 + 寻找规律
- Leetcode 396. Rotate Function (Easy) (java)
- LeetCode 396. Rotate Function 解题报告
- 【LeetCode】396. Rotate Function(java实现)
- leetcode_396. Rotate Function 对数组顺时针移动,求所有加权和的最大值,找递推公式
- [c语言] leetcode 396. Rotate Function
- 【LeetCode】396. Rotate Function(java实现)
- Leetcode 396. Rotate Function 旋转方程 解题报告
- LeetCode—396. Rotate Function
- LeetCode:396. Rotate Function
- LeetCode 396. Rotate Function
- LeetCode笔记:396. Rotate Function
- [LeetCode]--396. Rotate Function