Search a 2D Matrix II

// Search a 2D Matrix II
// https://leetcode.com/problems/search-a-2d-matrix-ii
class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int row = 0;
        int col = matrix[0].length-1;
        
        while (row < matrix.length && col >= 0){
            if (matrix[row][col] == target) return true;
            if (matrix[row][col] < target) row++;
            else if (matrix[row][col] > target) col--;
        }
       return false;
    }
}

Search a 2D Matrix

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix.length == 0) return false;
        int rows = matrix.length;
        int cols = matrix[0].length;
        
        int left = 0;
        int right = rows*cols-1;
        
        while(left <= right){
            int mid = left + (right-left)/2; // calculates the mid point of 1D array.
            int midElement = matrix[mid/cols][mid%cols]; // converting midpoint of 1D array to 2D array
            if(midElement == target) return true;
            if(midElement < target) left = mid+1;
            else right = mid-1;
        }
        return false;
    }
}

Similar codes

0 vote133 views1 answer
Spring data jpa inheritance repository
Java Spring
1 vote91 views1 answer
Last method in jdbc
Java
4 votes102 views1 answer
Source option 5 is no longer supported. Use 7 or later
Java
0 vote104 views2 answers
Java break string into words
Java
0 vote113 views1 answer
Get text from a jtextfield
Java
13 votes102 views3 answers
Junit dependency
Java
0 vote109 views1 answer
Java filter array by even numbers
Java
5 votes109 views5 answers
Bcrypt Password Hashing
Java
0 vote128 views3 answers
FileNotFoundException
Java
0 vote75 views1 answer
Spring Security JWT Authentication + PostgreSQL – RestAPIs SpringBoot + Spring MVC + Spring JPA
Java Spring