二分法（2）力扣刷题

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