LeetCode OJ 之 Search a 2D Matrix II （二维矩阵查找）

题目：

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.

思路：

从矩阵右上角开始比较，如果当前数字比target 大，则向前移动，如果比target小，则向下移动。否则返回真。

代码：

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) 
    {
        int row = matrix.size();
        if(row == 0)
            return false;
        int col = matrix[0].size();
        for(int i = 0 , j = col-1 ; i < row && j >= 0 ; )
        {
            if(matrix[i][j] == target)
                return true;
            if(matrix[i][j] > target)
                j--;
            else
                i++;
        }
        return false;
    }
};