Write an efficient algorithm that searches for a value in an m x nmatrix. This 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:
Consider the following 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] ]
Given target = 5
, return true
.
Given target = 20
, return false
.
题目链接:https://leetcode.com/problems/search-a-2d-matrix-ii/
题目分析:左上角开始
5ms,时间击败100%
class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
int n = matrix.length;
if (n == 0) {
return false;
}
int m = matrix[0].length;
int x = 0, y = m - 1;
while (x < n && y >= 0) {
if (matrix[x][y] > target) {
y--;
} else if (matrix[x][y] < target) {
x++;
} else {
return true;
}
}
return false;
}
}