Search a 2D Matrix

is basically binary search, I have a good grasp of the

Determine the row first, and then determine the column

1      Public BooleanSearchmatrix (int[] Matrix,inttarget) {2         if(Matrix = =NULL|| Matrix.length = = 0 | | Matrix[0].length = = 0) {3             return false;4         }5         intLow = 0;6         intHigh = Matrix.length-1;7          while(Low <=High ) {8             intMid = low+ (high-low)/2;9             if(Matrix[mid][0] >target) {TenHigh = Mid-1; One}Else if(Matrix[mid][0] <target) { ALow = Mid+1; -}Else { -                 return true; the             } -         } -         if(High < 0) { -             return false; +         } -         intL = 0; +         intr = Matrix[0].length-1; A          while(L <=r) { at             intMID = L + (r-l)/2; -             if(Matrix[high][mid] <target) { -L = mid+1; -}Else if(Matrix[high][mid] >target) { -r = Mid-1; -}Else { in                 return true; -             } to         } +         return false; -}

Bug Record:

1.high = Length-1. Don't forget to lose one, I forgot it two times.

2. When it is smaller than the matrix smallest inside, pay attention to judgment, that is, 17-19 lines

Search a 2D Matrix