Leetcode: 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.

For example,

Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target = 3, return true.

思路：二分法，把2d matrix 当成 1d array 来解。

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        int rows = matrix.size();
	    int cols = matrix.at(0).size();
	    int start = 0;
	    int end = rows * cols - 1;

	    while (start + 1 < end) {
		    int mid = start + (end - start) / 2;
		    int digit = matrix.at(mid / cols).at(mid % cols);
		    if (digit == target) {
			    return true;
		    }
		    else if (digit > target) {
			    end = mid;
		    }
		    else {
			    start = mid;
		    }
	    }

	    if (matrix.at(start / cols).at(start % cols) == target || matrix.at(end / cols).at(end % cols) == target) {
	        return true;
	    } 
	    return false;
    }
};