力扣74. 搜索二维矩阵(从左下开始)
https://leetcode-cn.com/problems/search-a-2d-matrix/
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();//列
int i=m-1;
int j=0;
while(i>=0 && j<=n-1)
{
if(target==matrix[i][j])
{
return true;
}
if(matrix[i][j]<target)
{
j++;
}
else
{
i--;
}
}
return false;
}
};