算法博客8 - 规则矩阵中找值

算法博客8 - 规则矩阵中找值

题目描述：

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.

解题思路：

从右上角开始寻找，大于目标值则往左移一位，小于目标值则往下移一位，一直寻找下去，如果找到最后一行或最前面一列还未找到则未能寻得该目标值。

代码：

	class Solution {
	public:
	    bool searchMatrix(vector<vector<int>>& matrix, int target) {
	        int m = matrix.size();
	        if (m == 0) return false;//如果为空则下条语句执行会报错，因此这里返回false。
	        int n = matrix[0].size();
	        int i = 0,j = n -1;
	        while (i < m && j >=0) {
	            if (matrix[i][j] == target)
	                return true;
	            else if (matrix[i][j] < target) {
	                i++;
	            } else {
	                j--;
	            }
	        } 
	        return false;
	    }
	};