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 vote108 views1 answer
Getarguments().getstring updates android
Java
0 vote109 views2 answers
Adding new field in existing kibana index using spark java
Java
0 vote147 views1 answer
Spring boot send username in email html template
Java
1 vote120 views2 answers
Image cropper implementation
Java
1 vote126 views1 answer
Javafx textarea new line with shift+enter
Java
0 vote111 views1 answer
Copying value from one input field to another input field using checkbox
Java
0 vote119 views1 answer
Java -jar -l resources\es.porperties -i ejemplo.txt -o inject.bin
Java
0 vote148 views3 answers
SetCookie("showPopupBannerBeta", 1, 1
Java
0 vote116 views1 answer
Spring boot jackson infinite recursion
Java
0 vote115 views1 answer
Uri/beecrowd problem no 1118 solution in Java
Java