原题网址:https://leetcode.com/problems/search-a-2d-matrix-ii/
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 in ascending from left to right.
- Integers in each column are sorted in ascending from top to bottom.
For 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
.
思路:因为行列均有序,我们分析某个行列的位置,如果该位置值小于目标值,则目标值只可能出现在该位置的右方和下方,如果该位置大于目标值,则目标值只可能出现在该位置的上方和左方。但是这里上下左右的四个方向皆有可能,怎么办呢?办法就是从反对角线的任意端点出发,例如我们从左下角,这样对于小于和大于的情况,就只需要向某一个方向移动了!遇到这种有序的问题(无论是二维还是高维),都可以使用类似方法,实现时间复杂度降低一个维度。
public class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
int row=matrix.length-1, col=0;
while (row>=0 && col<matrix[0].length) {
if (matrix[row][col] == target) return true;
if (matrix[row][col] < target) col ++; else row --;
}
return false;
}
}