< Summary

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

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
.ctor(...)100%22100%
SumRange(...)100%11100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RangeSumQueryImmutable\RangeSumQueryImmutablePrefixSum.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.RangeSumQueryImmutable;
 13
 14/// <inheritdoc />
 15public class RangeSumQueryImmutablePrefixSum : IRangeSumQueryImmutable
 16{
 17    private readonly int[] _prefixSum;
 18
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(n)
 22    /// </summary>
 23    /// <param name="nums"></param>
 124    public RangeSumQueryImmutablePrefixSum(int[] nums)
 125    {
 126        _prefixSum = new int[nums.Length + 1];
 27
 1428        for (var i = 0; i < nums.Length; i++)
 629        {
 630            _prefixSum[i + 1] = _prefixSum[i] + nums[i];
 631        }
 132    }
 33
 34    /// <summary>
 35    ///     Time complexity - O(1)
 36    ///     Space complexity - O(1)
 37    /// </summary>
 38    /// <param name="left"></param>
 39    /// <param name="right"></param>
 40    /// <returns></returns>
 41    public int SumRange(int left, int right)
 342    {
 343        return _prefixSum[right + 1] - _prefixSum[left];
 344    }
 45}