refactor 1351

fishercoder1534 · fishercoder1534 · commit e5f2a69c8b66 · 2020-10-02T06:41:24.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1351.java b/src/main/java/com/fishercoder/solutions/_1351.java
@@ -1,34 +1,5 @@
 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) {
