-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram34.java
More file actions
69 lines (44 loc) · 1.56 KB
/
program34.java
File metadata and controls
69 lines (44 loc) · 1.56 KB
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
57
58
59
60
61
62
63
64
65
66
67
68
69
/*
74. Search a 2D Matrix
Medium
12.1K
344
Companies
You are given an m x n integer matrix matrix with the following two properties:
Each row is sorted in non-decreasing order.
The first integer of each row is greater than the last integer of the previous row.
Given an integer target, return true if target is in matrix or false otherwise.
You must write a solution in O(log(m * n)) time complexity.
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
*/
package LeetCode;
public class program34 {
static boolean searchMatrix(int[][] matrix, int target) {
boolean flag = false;
int row = matrix.length;
int col = matrix[row].length;
for(int i=0;i<row;i++){
if(matrix[row][col] >target){
while(col>=0){
if(matrix[row][col]==target){
return true;
}
col--;
}
}
else{
}
}
return flag;
}
public static void main(String[] args) {
int[][] matrix = {{1,3,5,7},{10,11,16,20},{23,30,34,60}};
int target =3;
System.out.println(searchMatrix(matrix, target));
}
}