leetcode - 74. Search a 2D Matrix

最新推荐文章于 2019-05-09 17:47:01 发布

Zino-齐诺

最新推荐文章于 2019-05-09 17:47:01 发布

阅读量125

点赞数

分类专栏： leetcode 文章标签： leetcode 二分搜索

本文链接：https://blog.csdn.net/weixin_41938758/article/details/88968040

版权

leetcode 专栏收录该内容

71 篇文章 1 订阅

订阅专栏

二分搜索
在这里插入图片描述

class Solution {
public:
	bool searchMatrix(vector<vector<int>>& matrix, int target) {
		int m = matrix.size();
		if (!m) return 0;
		int n = matrix[0].size(), r;
        if(!n) return 0;
		int left(0), right(m - 1), mid;
		while ((right - left)>1)
		{
			mid = (left + right) / 2;
			if (target == matrix[mid][0])
			{
				return 1;
			}
			else if (target<matrix[mid][0])
			{
				right = mid;
			}
			else {
				left = mid;
			}
		}
        if(matrix[right][0]>target)
        {
            r = left;
        }else{
            r=right;
        }
		left = 0;
		right = n - 1;
		while ((right - left)>1)
		{
			mid = (left + right) / 2;
			if (target == matrix[r][mid])
			{
				return 1;
			}
			else if (target<matrix[r][mid])
			{
				right = mid;
			}
			else {
				left = mid;
			}
		}
		if (matrix[r][left] == target || matrix[r][right] == target)
		{
			return 1;
		}
		return 0;
	}
};