题解 | #二维数组中的查找#

class Solution {
public:
    bool Find(int target, vector<vector<int> > array) {
        int middle,left,right;
        int m=array.size();
        int n=array[0].size();
        for(int i=0;i<m;i++){
            left=0;
            right=n-1;
            while(left<=right){
                middle=left+(right-left)/2;
                if(array[i][middle]<target){
                    left=middle+1;
                }
                else if(array[i][middle]>target){
                    right=middle-1;
                }
                else{
                    return true;
                }
            }
        }
        return false;    
    }
};