Description
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.
Examples
Example 1:
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
Output: true
Example 2:
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
Output: false
解题思路
因为他是顺序排序的,所以对于每一行,只要检索最后一列的元素与target的关系,就能得到target有没有可能在这一行当中
代码
class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
if(matrix.length == 0 || matrix[0].length == 0)
return false;
int i, j;
int len = matrix[0].length;
for(i = 0; i < matrix.length; i++){
if (target <= matrix[i][len - 1]){
for(j = 0; j < len; j++){
if(matrix[i][j] == target)
return true;
}
return false;
}
}
return false;
}
}