class Solution {
public:
bool searchMatrix(vector<vector<int> > &matrix, int target) {
int row=0,col=matrix[0].size()-1;
while(col>=0&&row<matrix.size())
{
if(target==matrix[row][col])return true;
else if(target<matrix[row][col])col--;
else row++;
}
return false;
}
};
https://leetcode.com/problems/search-a-2d-matrix/descript...
https://leetcode.com/problems/search-a-2d-matrix/#/descri...
题目 https://leetcode.com/problems/search-a-2d-matrix/ 解析 题...
https://leetcode-cn.com/problems/search-a-2d-matrix/ （图片来...
题目链接 https://leetcode.com/problems/search-a-2d-matrix/ 解题...
原题 https://leetcode-cn.com/problems/search-a-2d-matrix/ 解...
本文标题：search-a-2d-matrix
本文链接：https://www.haomeiwen.com/subject/hedkcctx.html
网友评论