class Solution {
public:
int maxRotateFunction(vector<int>& A) {
int ans = 0,result=0;
int sum = 0;
for(int i = 0;i < A.size() ;i++)
ans += A[i]*i, sum += A[i];
result = ans;
for(int i = 1;i < A.size() ;i++){
result += sum;
result -= A[A.size()-i]*A.size();
ans = max(ans,result);
}
return ans;
}
};
leetcode 396. Rotate Function
最新推荐文章于 2024-09-25 16:05:14 发布