240. 搜索二维矩阵 II
难度中等939
编写一个高效的算法来搜索 *m* x *n*
矩阵 matrix
中的一个目标值 target
。该矩阵具有以下特性:
- 每行的元素从左到右升序排列。
- 每列的元素从上到下升序排列。
示例 1:
输入:matrix = [[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]], target = 5
输出:true
示例 2:
输入:matrix = [[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]], target = 20
输出:false
提示:
m == matrix.length
n == matrix[i].length
1 <= n, m <= 300
-109 <= matrix[i][j] <= 109
- 每行的所有元素从左到右升序排列
- 每列的所有元素从上到下升序排列
-109 <= target <= 109
1.c++
/*
* date: 2022-02-27
* city: hangzhou
* author: zhangyunbo
*/
#include <iostream>
#include <vector>
using namespace std;
class Solution {
bool isExist(const vector<vector<int>>& matrix,int x,int y,const int target)
{
if (x < 0 || x >= matrix.size())
{
return false;
}
if (y < 0 || y >= matrix[0].size())
{
return false;
}
int tmpVal = matrix[x][y];
if (target == tmpVal)
{
return true;
}
else if (target < tmpVal)
{
return isExist(matrix,x,y-1,target);
}
else
{
return isExist(matrix,x+1,y,target);
}
return false;
}
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if (matrix.size() <= 0)
{
return false;
}
int x = 0;
int y = matrix[0].size() - 1;
return isExist(matrix,x,y,target);
}
};
int main()
{
Solution slu;
vector<vector<int>> matrix = {{1,4,7,11,15},
{3,5,8,12,19},
{3,6,9,16,22},
{10,13,14,17,24},
{18,21,23,26,30}};
int target = 20;
std::cout << "find result: " << ((slu.searchMatrix(matrix,target) == true)?"true":"false") << std::endl;
}