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

//有序 二分查找

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