[leetcode] 240. Search a 2D Matrix II 解题报告

题目链接：https://leetcode.com/problems/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.

思路：根据数组的特点，每行从左到右，每列从上到下有序，因此我们从第０行的第n-1列开始搜索的时候，如果

１．matrix[i][j] > target说明我们要找的值在当前数组的左边，因此j--

２．matrix[i][j] > target说明我们要找的值在当前数组的下一行，因此i++

３．如果matrix[i][j] ＝ target可以返回true

代码如下：

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int m = matrix.size(), n = matrix[0].size(), 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;
    }
};