< Summary

Information
Class: LeetCode.Algorithms.SumOfVariableLengthSubarrays.SumOfVariableLengthSubarraysPrefixSum
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SumOfVariableLengthSubarrays\SumOfVariableLengthSubarraysPrefixSum.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 45
Line coverage: 100%
Branch coverage
100%
Covered branches: 6
Total branches: 6
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
SubarraySum(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SumOfVariableLengthSubarrays\SumOfVariableLengthSubarraysPrefixSum.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.SumOfVariableLengthSubarrays;
 13
 14/// <inheritdoc />
 15public class SumOfVariableLengthSubarraysPrefixSum : ISumOfVariableLengthSubarrays
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public int SubarraySum(int[] nums)
 224    {
 225        var prefix = new int[nums.Length];
 26
 227        prefix[0] = nums[0];
 28
 1429        for (var i = 1; i < nums.Length; i++)
 530        {
 531            prefix[i] = prefix[i - 1] + nums[i];
 532        }
 33
 234        var sum = 0;
 35
 1836        for (var i = 0; i < nums.Length; i++)
 737        {
 738            var start = Math.Max(0, i - nums[i]);
 39
 740            sum += prefix[i] - (start > 0 ? prefix[start - 1] : 0);
 741        }
 42
 243        return sum;
 244    }
 45}

Methods/Properties

SubarraySum(System.Int32[])