Sum of Variable Length Subarrays
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
Input
nums = [2,3,1]Output
11The subarray sums for indices 0, 1, and 2 are 2, 5, and 4, so the total sum is 11.
Example 2
Input
nums = [3,1,1,2]Output
13The subarray sums for indices 0, 1, 2, and 3 are 3, 4, 2, and 4, so the total sum is 13.
Constraints
- 1 <= n == nums.length <= 100
- 1 <= nums[i] <= 1000