【Lintcode】028.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.

题解：

Solution 1 ()

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) {
        if (matrix.empty() || matrix[].empty()) {
            return false;
        }

        int rowEnd = matrix.size() - ;
        int colEnd = matrix[].size() - ;
        int start = , mid = ;
        //rowMid
        while (start +  < rowEnd) {
            mid = start + (rowEnd - start) / ;
            if (matrix[mid][] == target) {
                return true;
            } else if (matrix[mid][] > target) {
                rowEnd = mid;
            } else {
                start = mid;
            }
        }

        int row = ;
        if (matrix[start][] <= target && matrix[start][colEnd] >= target) {
            row = start;
        } else if (matrix[rowEnd][] <= target && matrix[rowEnd][colEnd] >= target) {
            row = rowEnd;
        } else {
            return false;
        }
        start = ;

        //colMid
        while (start +  < colEnd) {
            mid = start + (colEnd - start) / ;
            if (matrix[row][mid] == target) {
                return true;
            } else if (matrix[row][mid] > target) {
                colEnd = mid;
            } else {
                start = mid;
            }
        }

        if(matrix[row][start] == target || matrix[row][colEnd] == target) {
            return true;
        }

        return false;
    }
};

Solution 2 ()

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) {
        if (matrix.empty() || matrix[].empty()) {
            return false;
        }

        int m = matrix.size(), n =  matrix[].size();
        int start = ;
        int end = m * n - ;
        int mid = ;

        while (start +  < end) {
            mid = start + (end - start) / ;
            int row = mid / n;
            int col = mid % n;
            if (matrix[row][col] == target) {
                return true;
            } else if (matrix[row][col] > target) {
                end = mid;
            } else {
                start = mid;
            }
        }

        if (matrix[start / n][start % n] == target) {
            return true;
        } else if (matrix[end / n][end % n] == target) {
            return true;
        } else {
            return false;
        }
    }
};