[LeetCode | Java | Binary Search 문제 풀이] 1351. Count Negative Numbers in a Sorted Matrix - Solution with Loop
99 Club 2기 | Java | Beginner📉 1351. Count Negative Numbers in a Sorted Matrix🏷 관련 주제 : Array Binary Search Matrix Algorithm ComplexityEasyGiven 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: 8Explanation: There are 8 negative..
2024. 6. 12.