-
Notifications
You must be signed in to change notification settings - Fork 2
/
SearchInMatrixSortedRowiseIncreasingOrder.java
56 lines (51 loc) · 1.58 KB
/
SearchInMatrixSortedRowiseIncreasingOrder.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
package Leetcode;
/**
* @author kalpak
*
* Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
*
* Integers in each row are sorted from left to right.
* The first integer of each row is greater than the last integer of the previous row.
*
* Example 1:
*
* Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
* Output: true
* Example 2:
*
*
* Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
* Output: false
*
*
* Constraints:
*
* m == matrix.length
* n == matrix[i].length
* 1 <= m, n <= 100
* -10^4 <= matrix[i][j], target <= 10^4
*/
public class SearchInMatrixSortedRowiseIncreasingOrder {
public static boolean searchMatrix(int[][] matrix, int target) {
if(matrix == null || matrix.length == 0 || matrix[0].length == 0)
return false;
int left = 0;
int right = matrix.length*matrix[0].length - 1;
while(left <= right) {
int mid = left + (right - left)/2;
int middleElement = matrix[mid/matrix[0].length][mid%matrix[0].length];
if(target == middleElement)
return true;
else if (middleElement < target)
left = mid + 1;
else
right = mid - 1;
}
return false;
}
public static void main(String[] args) {
int[][] matrix = new int[][]{{1, 3, 5, 7}, {10, 11, 16, 20}, {23, 30, 34, 60}};
System.out.println(searchMatrix(matrix, 16));
System.out.println(searchMatrix(matrix, 9));;
}
}