lintcode:Search a 2D Matrix

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 from left to right.
The first integer of each row is greater than the last integer of the previous row.

Example
Consider the following matrix:

[
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
Given target = 3, return true.

Challenge
O(log(n) + log(m)) time

class Solution {
public:
    /**
     * @param matrix, a list of lists of integers
     * @param target, an integer
     * @return a boolean, indicate whether matrix contains target
     */
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        // write your code here
        if(matrix.size()==0){
            return false;
        }

        int row;
        int i=0,j=matrix.size()-1;
        while(i<=j){
            int mid=i+(j-i)/2;
            if(target==matrix[mid][0]){
                return true;
            }else if(target<matrix[mid][0]){
                j=mid-1;
            }else{
                i=mid+1;
            }
        }
        //循环条件是i<=j，如果找不到target,最后的结果是j索引的数小于target
        //索引的数大于targe

        row=j;

        i=0,j=matrix[row].size()-1;
        while(i<=j){
            int mid=i+(j-i)/2;
            if(target==matrix[row][mid]){
                return true;
            }else if(target<matrix[row][mid]){
                j=mid-1;
            }else{
                i=mid+1;
            }
        }

        return false;
    }
};