add 1351

fishercoder1534 · fishercoder1534 · commit 137912441b83 · 2020-02-15T20:10:10.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1351|[Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1351.java) | |Easy|Array, Binary Search|
 |1349|[Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1349.java) | |Hard|Dynamic Programming|
 |1348|[Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1348.java) | |Medium|Design|
 |1347|[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1347.java) | |Easy|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1351.java b/src/main/java/com/fishercoder/solutions/_1351.java
@@ -0,0 +1,46 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1351. Count Negative Numbers in a Sorted Matrix
+ *
+ * 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
+ * */
+public class _1351 {
+    public static class Solution1 {
+        public int countNegatives(int[][] grid) {
+            int count = 0;
+            for (int[] row : grid) {
+                for (int v : row) {
+                    if (v < 0) {
+                        count++;
+                    }
+                }
+            }
+            return count;
+        }
+    }
+}
