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

bool Find(int target, int** array, int arrayRowLen, int* arrayColLen) {
    for (int i = 0; i < arrayRowLen; i++) {
        int left = 0, right = arrayColLen[i] - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (array[i][mid] > target) {
                right = mid - 1;
            } else if (array[i][mid] < target) {
                left = mid + 1;
            } else {
                return true;
            }
        }
    }
    return false;
}