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 vote221 views1 answer
What is treeset in java
Java
0 vote233 views1 answer
Ignore sonarlint line java
Java
0 vote246 views1 answer
Enum type spring boot entity
Java
0 vote235 views1 answer
Mockito verify more than once
Java
0 vote230 views1 answer
Android java string video
Java
0 vote228 views1 answer
Stackoverflow java enum with constructor
Java
0 vote232 views1 answer
Framboise bleue ou mure
Java
0 vote270 views1 answer
Access each key and value in a hashmap java
Java
0 vote294 views1 answer
Intellij java fx new window
Java
1 vote242 views2 answers
Use findviewbyid in fragment
Java