class Solution {
public:
int sumOddLengthSubarrays(vector<int>& arr) {
int n = arr.size();
int ans = 0;
for (int i = 0; i < n; ++i) {
int k = (i + 1) * (n - i); // total_left * total_right
k = ((i+2)/2)*((n-i+1)/2) + ((i+1)/2)*((n-i)/2);
//cout << k << '\n';
ans += k*arr[i];
}
return ans;
}
};
'알고리즘 > leetcode' 카테고리의 다른 글
953. Verifying an Alien Dictionary (0) | 2022.09.15 |
---|---|
496. Next Greater Element I (0) | 2022.09.13 |
57. Insert Interval (0) | 2022.09.01 |
16. 3Sum Closest (0) | 2022.08.28 |
417. Pacific Atlantic Water Flow (0) | 2022.08.26 |