Search a 2D Matrix
2015-08-20 10:43
281 查看
原题如下:
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 from left to right.
The first integer of each row is greater than the last integer of the previous row.
For example,
Consider the following matrix:
[
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
Given target = 3, return true.
这个题其实还是很简单的,直接暴力也能AC, C++代码如下:
不过既然有规律可循,那肯定要找到一种高效的方法了,可以考虑把矩阵“展平”,这不就是二分查找嘛。这样一下子就可以把时间从O(MN)降到了O(Log(MN))了。AC过的C++代码如下:
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 from left to right.
The first integer of each row is greater than the last integer of the previous row.
For example,
Consider the following matrix:
[
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
Given target = 3, return true.
这个题其实还是很简单的,直接暴力也能AC, C++代码如下:
[code] bool searchMatrix(vector<vector<int>>& matrix, int target) { if(matrix.size() < 1 || matrix[0].size() < 1) return false; int m = matrix.size(), n = matrix[0].size(); for(int i=0; i<m; i++){ for(int j=0; j<n; j++){ if(matrix[i][j] == target){ return true; } } } return false; }
不过既然有规律可循,那肯定要找到一种高效的方法了,可以考虑把矩阵“展平”,这不就是二分查找嘛。这样一下子就可以把时间从O(MN)降到了O(Log(MN))了。AC过的C++代码如下:
[code] bool searchMatrix(vector<vector<int>>& matrix, int target) { if(matrix.size() < 1 || matrix[0].size() < 1) return false; int m = matrix.size(), n = matrix[0].size(); int left = 0, right = m * n - 1; while(left <= right){ int mid = (left + right) / 2; int i = mid /n, j = mid % n; if(matrix[i][j] == target) return true; else if(matrix[i][j] > target){ right = mid - 1; }else{ left = mid + 1; } } return false; }
相关文章推荐
- hdu1010 Tempter of the Bone(DFS+剪枝)
- Python条件语句
- php设计模式之原型模式
- QT creator+OpenCV2.4.2+MinGW 在windows下开发环境配置
- solr4.2增量索引之同步(修改,删除,新增)--转载
- Android(java)学习笔记180:Android MediaPlayer 播放prepareAsync called in state 8解决办法
- MySQL命令行导出数据库
- 用于并行计算的多线程数据结构,第 1 部分: 设计并发数据结构
- Java Calendar详解 - 获取近一周日期与星期
- 5行代码实现一致性哈希
- ubuntu14.04下配置python环境
- 接口到底能不能实例化。
- JavaScript的一些技巧
- android res之shape
- edittext不显示光标的情况
- SVN使用之—分支主干合并
- java的垃圾回收
- OAuth 的机制原理
- 微服务架构
- 【COCI2012】蜡笔