每日一题.1588. 所有奇数长度子数组的和

解题思路

简单遍历

代码

class Solution {
    public int sumOddLengthSubarrays(int[] arr) {
        int n = arr.length,ans = 0;
        int[] pre = new int[n+1];
        for (int i=1;i<=n;i++){
            pre[i]=pre[i-1]+arr[i-1];
        }
        //找到当前数组长度的最长奇数段
        int dis = n;
        if (n%2!=0){
            dis = n-1;
        }
        for (int leng=1;leng<=n;leng=leng+2){//不同奇数长度的数组
            for (int left=0;left+leng-1<n;left++){//左端点
                int right = left-1+leng;
                ans+=pre[right+1]-pre[left];
            }
        }
        return  ans;
    }
}