-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCountNegativesMatrix.go
62 lines (43 loc) · 1 KB
/
CountNegativesMatrix.go
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/*
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
*/
package main
import (
"log"
)
func main() {
tests := [][][]int{{{4, 3, 2, -1}, {3, 2, 1, -1}, {1, 1, -1, -2}, {-1, -1, -2, -3}}, {{3, 2}, {1, 0}}, {{1, -1}, {-1, -1}}, {{-1}}}
for _, test := range tests {
log.Printf("countNegatives(%v) = %d\n", test, countNegatives(test))
}
}
func countNegatives(grid [][]int) int {
res := 0
for row := 0; row < len(grid); row++ {
for col := 0; col < len(grid[row]); col++ {
if grid[row][col] < 0 {
res++
}
}
}
return res
}