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

1 vote108 views1 answer
Jdk path ubuntu
Java
1 vote126 views2 answers
Java swing dialog box
Java
1 vote101 views1 answer
Convert string into unicode java
Java
-7 votes110 views1 answer
All consonants java array
Java
0 vote115 views1 answer
How to install clojure on linux
Java
1 vote124 views1 answer
Foreach not applicable to type - binary tree sort
Java
0 vote133 views1 answer
In java how to compare two strings
Java
2 votes112 views1 answer
Java number of days between dates
Java
0 vote117 views3 answers
Fragment call activity
Java
0 vote102 views2 answers
Mountain array leetcode
Java