leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0396.cpp (442B)

0 class Solution { 1 public: 2 int maxRotateFunction(const vector<int> &nums) const { 3 const int n = size(nums); 4 int sum = 0, crnt = 0; 5 6 for (int i = 0; i < n; i++) { 7 crnt += i * nums[i]; 8 sum += nums[i]; 9 } 10 11 int res = crnt; 12 for (int i = n - 1; i >= 0; i--) { 13 crnt += sum - nums[i] * n; 14 res = max(res, crnt); 15 } 16 17 return res; 18 } 19 };