题解:
class Solution {
public:
int sumOddLengthSubarrays(vector<int>& arr) {
int sum = 0;
int len = arr.size();
//后面依次递增 直至小于等于长度len
int gap = 1;
do{
//i上限控制开头 j上限控制结尾
for(int i = 0;i<=len-gap;i++){
for(int j = i;j<i+gap;j++){
sum += arr[j];
}
}
}while((gap+=2)<=len);
return sum;
}
};