Search a 2D Matrix IIWrite an efficient algorithm that searches for a value in an m x n matrix. This
来源:互联网 发布:Java全套视频 编辑:程序博客网 时间:2024/05/22 14:23
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
- Integers in each row are sorted in ascending from left to right.
- Integers in each column are sorted in ascending from top to bottom.
For example,
Consider the following 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]]
Given target = 5
, return true
.
Given target = 20
, return false
.
如果比目标数小,则比较下一列最后一行的数和目标数的大小;如果比目标数大,则比较该数同一列上一行的数,逐次向上,一旦找到目标数,即返回
true,否则返回false。
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int row = matrix.size();if(row == 0) return false;
int column = matrix[0].size();
int x = row - 1;
int y = 0;
while(x >= 0 && y < m)
{
if(matrix[y][x] == target) return true;
else if(matrix[y][x] > target)
{
x--;
}
else y++;
}
return false;
}
0 0
- Search a 2D Matrix IIWrite an efficient algorithm that searches for a value in an m x n matrix. This
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D Matrix
- Search a 2D matrix
- Opengl超级宝典 Xcode环境配置
- Gerrit新用户基本操作小结
- easyui datebox 只显示年月
- 简单的状态防火墙
- http 状态码 小结
- Search a 2D Matrix IIWrite an efficient algorithm that searches for a value in an m x n matrix. This
- json的初步理解
- Codeforces 780A-Andryusha and Socks
- Java高级程序员面试经历
- 大型企业选择私有云的原因
- node.js视频(共20讲)
- 国医馆项目(杂七杂八)
- ubuntu安装nginx反向代理tomcat
- PDO多种方式取得查询结果