首页 > 代码库 > LeetCode[Array]: Search a 2D Matrix
LeetCode[Array]: Search a 2D Matrix
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.
这个题目实际上考查的是二分查找,通过下标操作可以将矩阵变成一个一维升序数组,我的C++实现代码如下:
bool searchMatrix(vector<vector<int> > &matrix, int target) { int row = matrix.size(), col = matrix[0].size(); int low = 0, high = row * col - 1; while (low <= high) { int middle = (low + high) >> 1; int midVal = matrix[middle / col][middle % col]; if (midVal == target) return true; else if (midVal > target) high = middle - 1; else low = middle + 1; } return false; }
LeetCode[Array]: Search a 2D Matrix
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。