java.lang.Object
g1301_1400.s1351_count_negative_numbers_in_a_sorted_matrix.Solution

public class Solution extends Object
1351 - Count Negative Numbers in a Sorted Matrix.<p>Easy</p> <p>Given a <code>m x n</code> matrix <code>grid</code> which is sorted in non-increasing order both row-wise and column-wise, return <em>the number of <strong>negative</strong> numbers in</em> <code>grid</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> grid = [[4,3,2,-1],[3,2,1,-1],[1,1,-1,-2],[-1,-1,-2,-3]]</p> <p><strong>Output:</strong> 8</p> <p><strong>Explanation:</strong> There are 8 negatives number in the matrix.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> grid = [[3,2],[1,0]]</p> <p><strong>Output:</strong> 0</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == grid.length</code></li> <li><code>n == grid[i].length</code></li> <li><code>1 <= m, n <= 100</code></li> <li><code>-100 <= grid[i][j] <= 100</code></li> </ul> <p><strong>Follow up:</strong> Could you find an <code>O(n + m)</code> solution?</p>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • countNegatives

      public int countNegatives(int[][] grid)