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 vote287 views1 answer
Plus One Java
Java
2 votes305 views5 answers
True
Java
0 vote292 views1 answer
Java thread syncronized locker
Java
2 votes279 views1 answer
Java do something after x seconds without stopping everything else
Java
0 vote269 views1 answer
How to return string in java
Java
3 votes295 views1 answer
Ocha in japanese
Java
0 vote360 views2 answers
Decision tree drools using spring boot
Java Spring
0 vote316 views1 answer
How to compare between to char array java
Java
0 vote323 views1 answer
Intellisense for eclipse java
Java
1 vote340 views1 answer
Java get ram usage
Java