< Summary

Information
Class: LeetCode.Algorithms.CountNegativeNumbersInSortedMatrix.CountNegativeNumbersInSortedMatrixStaircase
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CountNegativeNumbersInSortedMatrix\CountNegativeNumbersInSortedMatrixStaircase.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
Total lines: 49
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
CountNegatives(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CountNegativeNumbersInSortedMatrix\CountNegativeNumbersInSortedMatrixStaircase.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 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.CountNegativeNumbersInSortedMatrix;
 13
 14/// <inheritdoc />
 15public sealed class CountNegativeNumbersInSortedMatrixStaircase : ICountNegativeNumbersInSortedMatrix
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n + m)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="grid"></param>
 22    /// <returns></returns>
 23    public int CountNegatives(int[][] grid)
 224    {
 225        var count = 0;
 26
 227        var m = grid.Length;
 228        var n = grid[0].Length;
 29
 230        var i = 0;
 231        var j = n - 1;
 32
 1133        while (i < m && j >= 0)
 934        {
 935            if (grid[i][j] < 0)
 436            {
 437                count += m - i;
 38
 439                j--;
 440            }
 41            else
 542            {
 543                i++;
 544            }
 945        }
 46
 247        return count;
 248    }
 49}