LeetCode 240. 搜索二维矩阵 II

暴力便利

遍历+二分查找

class Solution {
public:
    bool binary_search(vector<int>& nums, int target)
    {
        int left = 0;
        int right = nums.size()-1;

        while(left<=right)
        {
            int mid = (left+right)>>1;
            if(nums[mid] == target)
            {
                return true;
            }
            else if(nums[mid] < target)
            {
                left = mid + 1;
            }
            else
            {
                right = mid - 1;
            }
        }

        return false;
    }
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        for(int i=0;i<matrix.size();i++)
        {
            if(binary_search(matrix[i], target))
                return true;
        }
        return false;
    }
};