240. Search a 2D Matrix II
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 in ascending from left to right.
Integers in each column are sorted in ascending from top to bottom.
Difficulty:Medium
Example:
[
[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.
方法:对角线
- Time complexity : O ( m + n ) O\left ( m+n \right ) O(m+n)
- Space complexity :
O
(
1
)
O\left ( 1 \right )
O(1)
思路:
对比右上角元素与target大小,如果相等,返回true,如果target大,说明不在这一行,i++,反之说明不在这一列,j–。
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int m = matrix.size();
if (m == 0) return false;
int n = matrix[0].size();
for(int i = 0, j = n-1; i < m && j >=0;){
if(matrix[i][j] == target)
return true;
else if(matrix[i][j] < target)
i++;
else
j--;
}
return false;
}
};