题解 | #逐层二分查找——二维数组中的查找#

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