LeetCode 74. 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.

二分查找，返回结果与target比较

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int n=matrix.size();
        if((n==1&&matrix[0].size()==0)||n==0) {
            return false;
        }
        int f1=find1(0,matrix.size(),matrix,target);
        int f2=find2(0,matrix[f1].size(),matrix,target,f1);
        
        if(matrix[f1][f2]==target) return true;
        else return false;
    }
private:
    int find1(int l,int r,vector<vector<int>> v,int target){
        int m;
        while(r-l>1){
            m=l+(r-l)/2;
            if(v[m][0]>target) r=m;
            else l=m;
        }
        return l;
    }
    int find2(int l,int r,vector<vector<int>> v,int target,int k){
        int m;
        while(r-l>1){
            m=l+(r-l)/2;
            if(v[k][m]>target) r=m;
            else l=m;
        }
        return l;
    }
    
};