solves count negative number in sorted matrix

Author: anishLearnsToCode

README.md

@@ -345,7 +345,7 @@
 | 1337 | [The K Weakest Rows In A Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix)                                                       |                                                            [![Java](assets/java.png)](src/TheKWeakestRowsInAMatrix.java)                                                             |                                                                                                                                   |
 | 1342 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero)                               |                                                       [![Java](assets/java.png)](src/NumberOfStepsToReduceANumberToZero.java)                                                        |                                                                                                                                   |
 | 1346 | [Check if N and It's Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist)                                                    |                       [![Java](assets/java.png)](src/CheckIfNAndItsDoubleExist.java) [![Python](assets/python.png)](python/check_if_n_and_its_double_exist.py)                       |                                                                                                                                   |
-| 1351 | [Count Negative Numbers In A Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix)                                 |                                                                                                                                                                                      |                                                                                                                                   |
+| 1351 | [Count Negative Numbers In A Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix)                                 |                                                       [![Java](assets/java.png)](src/CountNegativeNumbersInSortedMatrix.java)                                                        |                                                                                                                                   |
 | 1356 | [Sort Integers by Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits)                                             |                                                                                                                                                                                      |                                                                                                                                   |
 | 1360 | [Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates)                                                   |                                                                                                                                                                                      |                                                                                                                                   |
 | 1365 | [How Many Numbers Are Smaller Than Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number)               |                                                                                                                                                                                      |                                                                                                                                   |

src/CountNegativeNumbersInSortedMatrix.java

@@ -0,0 +1,17 @@
+public class CountNegativeNumbersInSortedMatrix {
+    public int countNegatives(int[][] grid) {
+        final int rows = grid.length, columns = grid[0].length;
+        int negativeNumbers = 0, negativeColumnIndex = columns;
+        for (int[] row : grid) {
+            negativeNumbers += columns;
+            for (int column = 0 ; column < negativeColumnIndex ; column++) {
+                if (row[column] < 0) {
+                    negativeColumnIndex = column;
+                    break;
+                }
+                negativeNumbers--;
+            }
+        }
+        return negativeNumbers;
+    }
+}