Time: 0 ms (100.00%), Space: 41.8 MB (92.76%) - LeetHub

Author: AndrewSpourgeon

0074-search-a-2d-matrix/0074-search-a-2d-matrix.java

@@ -0,0 +1,22 @@
+class Solution {
+    public boolean searchMatrix(int[][] matrix, int target) {
+        int x=0;
+        boolean isFound=false;
+        if(target>=matrix[matrix.length-1][0]){
+            x=matrix.length-1;
+        }
+        else{
+            for(int i=0;i<matrix.length-1;i++){
+                if(target>=matrix[i][0] && target < matrix[i+1][0]){
+                    x=i;
+             }
+           }
+        }
+        for(int i=0;i<matrix[0].length;i++){
+            if(matrix[x][i]==target){
+                isFound=true;
+            }
+        }
+        return isFound;
+    }
+}