3731. Sum Of Variable Length Subarrays¶

3731. Sum of Variable Length Subarrays

Easy

You are given an integer array nums of size n. For each index i where 0 <= i < n, define a subarray nums[start ... i] where start = max(0, i - nums[i]).

Return the total sum of all elements from the subarray defined for each index in the array.

Example 1:

Example 2:

Constraints:

• 1 <= n == nums.length <= 100
• 1 <= nums[i] <= 1000

Solution¶

class Solution {
    public int subarraySum(int[] nums) {
        int n = nums.length;
        int res = 0;
        for (int i = 0; i < n; i++) {
            int start = Math.max(0, i - nums[i]);
            for (int j = start; j <= i; j++) res += nums[j];
        }
        return res;
    }
}

Complexity Analysis¶

• Time Complexity: O(?)
• Space Complexity: O(?)

Explanation¶

[Add detailed explanation here]