-
Notifications
You must be signed in to change notification settings - Fork 0
/
Leetcode00240.java
41 lines (39 loc) · 1020 Bytes
/
Leetcode00240.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
/**
* 240. Search a 2D Matrix II
*
* @link https://leetcode.com/problems/search-a-2d-matrix-ii
* @author vutiendat3601
* @date 2024-06-27
*/
public class Leetcode00240 {
public boolean searchMatrix(int[][] matrix, int target) {
final int n = matrix.length;
final int m = matrix[0].length;
int row = 0;
int col = m - 1;
while (row < n && col >= 0) {
if (matrix[row][col] == target) {
return true;
}
if (matrix[row][col] > target) {
col--;
} else if (matrix[row][col] < target) {
row++;
}
}
return false;
}
public static void main(String[] args) {
final int[][] 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}
};
final int target = 5;
final Leetcode00240 leetcode00240 = new Leetcode00240();
final boolean isFound = leetcode00240.searchMatrix(matrix, target);
System.out.println("isFound: " + isFound);
}
}