-
Notifications
You must be signed in to change notification settings - Fork 2
/
SearchInMatrixSortedRowiseColumnwise.java
52 lines (48 loc) · 1.62 KB
/
SearchInMatrixSortedRowiseColumnwise.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
package Leetcode;
/**
* @author kalpak
*
* Write an efficient algorithm that searches for a target value in an m x n integer matrix. The matrix has the following properties:
*
* Integers in each row are sorted in ascending from left to right.
* Integers in each column are sorted in ascending from top to bottom.
*
* Example 1:
* Input: matrix = [[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]], target = 5
* Output: true
*
* Example 2:
* Input: matrix = [[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]], target = 20
* Output: false
*
* Constraints:
*
* m == matrix.length
* n == matrix[i].length
* 1 <= n, m <= 300
* -10^9 <= matix[i][j] <= 10^9
* All the integers in each row are sorted in ascending order.
* All the integers in each column are sorted in ascending order.
* -10^9 <= target <= 10^9
*
*/
public class SearchInMatrixSortedRowiseColumnwise {
public static boolean searchMatrix(int[][] matrix, int target) {
int row = 0;
int col = matrix[0].length - 1;
while (row >= 0 && row < matrix.length && col >= 0 && col < matrix[0].length) {
if(matrix[row][col] == target)
return true;
else if (matrix[row][col] > target)
col--;
else
row++;
}
return false;
}
public static void main(String[] args) {
int[][] matrix = new int[][]{{1,4,7,11,15},{2,5,8,12,19},{3,6,9,16,22},{10,13,14,17,24},{18,21,23,26,30}};
System.out.println(searchMatrix(matrix, 5));
System.out.println(searchMatrix(matrix, 20));
}
}