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.

解题思路：

首先选取数组中右上角的数字。如果该数字等于要查找的数字，查找过程结束；
如果该数字大于要查找的数字，剔除这个数字所在的列；如果该数字小于要查找的数字，剔除这个数字所在的行。
也就是说如果要查找的数字不在数组的右上角，则每一次都在数组的查找范围中剔除一行或者一列，这样每一步
都可以缩小查找的范围，直到找到要查找的数字，或者查找范围为空。

AC代码如下：

class Solution {
public:
	bool searchMatrix(vector<vector<int>>& matrix, int target) {
		if (matrix.size() == 0 || matrix[0].size() == 0) return false;
		int rows = matrix.size();
		int cols = matrix[0].size();
		int start_row = 0, start_col = cols - 1;
		while (start_row < rows && start_col >= 0){
			if (matrix[start_row][start_col] == target) return true;
			else if (matrix[start_row][start_col] < target) ++start_row;
			else --start_col;
		}
		return false;
	}
};