1351|Count Negative Numbers in a Sorted Matrix(数组)

最新推荐文章于 2023-08-07 00:20:23 发布

Asteroid 325

最新推荐文章于 2023-08-07 00:20:23 发布

阅读量124

点赞数

分类专栏： leedcode_Algorithm

本文链接：https://blog.csdn.net/weixin_43846020/article/details/109997248

版权

leedcode_Algorithm 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

计算在有序矩阵的负数个数

Given a m * n matrix grid which is sorted in non-increasing order both row-wise and column-wise. （行和列的非递增顺序。）

Return the number of negative numbers in grid.

Example 1:
Input: grid = [[4,3,2,-1],[3,2,1,-1],[1,1,-1,-2],[-1,-1,-2,-3]]
Output: 8
Explanation: There are 8 negatives number in the matrix.

Example 2:
Input: grid = [[3,2],[1,0]]
Output: 0

Example 3:
Input: grid = [[1,-1],[-1,-1]]
Output: 3

Example 4:
Input: grid = [[-1]]
Output: 1

Constraints:
m == grid.length
n == grid[i].length
1 <= m, n <= 100
-100 <= grid[i][j] <= 100

class Solution {
    public int countNegatives(int[][] grid) {

     int n=0;
     for(int i=0;i<grid.length;i++){
         for(int j=0;j<grid[i].length;j++){
             if(grid[i][j]<0){
                 n++;
             }
         }
     }
     return n;

    }
}