class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int Y = matrix.size();
int X = matrix[0].size();
int yy = 0, xx = X-1;
while(yy < Y && matrix[yy][xx] < target) yy++;
if(yy >= Y) return false;
while(xx >= 0 && matrix[yy][xx] > target) xx--;
if(xx < 0) return false;
return matrix[yy][xx] == target;
}
};
leetcode 74. 搜索二维矩阵
最新推荐文章于 2024-06-10 13:32:03 发布