leetcode74-搜索二维矩阵

两次二分查找
整体思路先根据二分查找找出这个数应该在哪一行 再根据二分查找在这一行中查找

bool searchMatrix(int** matrix, int matrixSize, int* matrixColSize, int target){
    if(matrixSize==0||*matrixColSize==0)
       return 0;
    int low=0,high=matrixSize-1,mid=0;
    int targetrow=-1;
    int flag=0;
    while(low<=high)//第一次二分查找找出这个数应该在哪一行
    {
       mid=(low+high)/2;
       if(matrix[mid][0]==target)
       {
           targetrow=mid;
           break;
       }
       else if(matrix[mid][0]<target)
            low=mid+1;
       else
           high=mid-1;
    }
    targetrow=mid;
    if(matrix[targetrow][0]>target&&targetrow>0)
       targetrow-=1;
    printf("%d\n",targetrow);
    low=0;
    high=*matrixColSize-1;
    while(low<=high)//在这行中查找是否存在这个数
    {
        mid=(low+high)/2;
       if(matrix[targetrow][mid]==target)
       {
           flag=1;
           break;
       }
       else if(matrix[targetrow][mid]<target)
            low=mid+1;
       else
           high=mid-1;
    }
     return flag;
}

一次二分查找
附上官方题解解释
https://leetcode-cn.com/problems/search-a-2d-matrix/solution/sou-suo-er-wei-ju-zhen-by-leetcode/

bool searchMatrix(int** matrix, int matrixSize, int* matrixColSize, int target){
    if(matrixSize==0||*matrixColSize==0)
       return 0;
    int low=0,high=*matrixColSize*matrixSize-1,mid=0;
    int flag=0;
    while(low<=high)//在这行中查找是否存在这个数
    {
        mid=(low+high)/2;
       if(matrix[mid/(*matrixColSize)][mid%(*matrixColSize)]==target)
       {
           flag=1;
           break;
       }
       else if(matrix[mid/(*matrixColSize)][mid%(*matrixColSize)]<target)
            low=mid+1;
       else
           high=mid-1;
    }
     return flag;
}