< Summary

Information
Class: LeetCode.Algorithms.ZeroArrayTransformation1.ZeroArrayTransformation1PrefixSum
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ZeroArrayTransformation1\ZeroArrayTransformation1PrefixSum.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 48
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
IsZeroArray(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ZeroArrayTransformation1\ZeroArrayTransformation1PrefixSum.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.ZeroArrayTransformation1;
 13
 14/// <inheritdoc />
 15public class ZeroArrayTransformation1PrefixSum : IZeroArrayTransformation1
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n + m)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="queries"></param>
 23    /// <returns></returns>
 24    public bool IsZeroArray(int[] nums, int[][] queries)
 225    {
 226        var prefixSum = new int[nums.Length + 1];
 27
 1228        foreach (var query in queries)
 329        {
 330            prefixSum[query[0]]++;
 331            prefixSum[query[1] + 1]--;
 332        }
 33
 234        var count = 0;
 35
 1036        for (var i = 0; i < nums.Length; i++)
 437        {
 438            count += prefixSum[i];
 39
 440            if (count < nums[i])
 141            {
 142                return false;
 43            }
 344        }
 45
 146        return true;
 247    }
 48}