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.
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
给定一个矩阵和一个数,矩阵按升序从左到右从上到下排列,查找矩阵中是否有这个元素。有则返回true,没有就返回false。
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if(matrix.empty()||matrix[0].empty()) return false;
for(int i=0;i<matrix.size();i++)
for(int j=0;j<matrix[0].size();j++){
if(matrix[i][j]==target) return true;
if(matrix[i][j]>target) return false;
}
return false;
}
};