class Solution {
public:
bool searchMatrix(vector<vector<int> > &matrix, int target) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int m=matrix.size();
int n=matrix[0].size();
int row=0,col=n-1;//右上角的节点
while(row<m&&col>=0)//O(m+n)
{
if(matrix[row][col]==target)
return true;
else if(matrix[row][col]<target)
row++;
else if(matrix[row][col]>target)
col--;
}
return false;
}
};
【leetcode】Search a 2D Matrix
最新推荐文章于 2021-01-11 22:02:57 发布