-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram53.java
More file actions
48 lines (34 loc) · 1.14 KB
/
program53.java
File metadata and controls
48 lines (34 loc) · 1.14 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/*
1351. Count Negative Numbers in a Sorted Matrix
Easy
3.3K
92
Companies
Given a m x 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
*/
package LeetCode;
public class program53 {
static int countNegatives(int[][] grid) {
int cnt = 0;
for (int i = 0; i < grid.length ; i++) {
for (int j = 0; j < grid[i].length ; j++) {
if (grid[i][j] < 0){
cnt += grid[i].length - j;
break;
}
}
}
return cnt;
}
public static void main(String[] args) {
int[][] grid = {{4,3,2,-1},{3,2,1,-1},{1,1,-1,-2},{-1,-1,2,-3}};
System.out.println(countNegatives(grid));
}
}