Leetcode # 240 Search a 2D Matrix II

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

• Integers in each row are sorted in ascending from left to right.
• Integers in each column are sorted in ascending from top to bottom.

For example,

Consider the following matrix:

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 5, return true.

Given target = 20, return false.

Difficulty:Medium

第一次使用暴力解法超时了，想着每一行用分治法搜索试试，果然通过了，不过run time是300ms，感觉时间还是挺长，不知道有没有高人有更牛逼的解法。

int binary_sort(vector<int>& array, int length, int value)  
{  
    int start = 0;  
    int end = length -1;  
  
    while(start <= end){  
          
        int middle = start + ((end - start) >> 1);  
        if(value == array[middle])  
            return middle;  
        else if(value > array[middle]){  
            start = middle + 1;  
        }else{  
            end = middle -1;  
        }  
    }  
  
    return -1;  
} 
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int m = matrix[0].size();
        int n = matrix.size();
        for(int i = 0;i<n;i++)
        {
            if(matrix[i][0]>target||matrix[i][m-1]<target)
               continue;
            int j = binary_sort(matrix[i],m,target);
            if(j!=-1)
               return true;
        }
        return false;
    }