Search in 2D matrix

// 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 vote176 views2 answers
Math.random every number no range
Java
-1 vote207 views1 answer
Why is java so verbose
Java
1 vote189 views1 answer
Java scanner netLine
Java
0 vote161 views1 answer
What is final class
Java
9 votes191 views6 answers
Print java
Java
13 votes208 views2 answers
How to remove letters from string
Java
6 votes387 views1 answer
Spring h2 database dependency
Java Spring
0 vote179 views1 answer
How to circular a bitmap android
Java
0 vote224 views2 answers
Matrix Diagonal Sum
Java
0 vote195 views1 answer
OCA Exam Questions
Java