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

106 votes186 views6 answers
Switch en java
Java
2 votes182 views4 answers
Jdbc
Java
0 vote178 views1 answer
Compress a directory in java
Java
1 vote192 views1 answer
Mockito throw exception void method
Java
13 votes174 views3 answers
Javascript loop through arra
Java
0 vote187 views1 answer
Set button text android
Java
0 vote175 views1 answer
Armstrong Numbers Between Two Integers
Java
0 vote182 views1 answer
Check if short int or long java
Java
3 votes180 views1 answer
Ocha in japanese
Java
0 vote195 views1 answer
1 2 1 3 2 1 4 3 2 1 3 2 1 2 1 1 java
Java