【LeetCode】240. Search a 2D Matrix II

240. Search a 2D Matrix II

Medium

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.

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 r = matrix.size();
        if(r==0) return false; 
        int c = matrix[0].size();
        if(c==0) return false;
        
        if(matrix[0][0]>target||matrix[r-1][c-1]<target) return false;
        int i = 0,j=c-1;
        while(i<r&&j>=0){
            if(target == matrix[i][j]) return true;
            else if(target<matrix[i][j]) j--;
            else i++;
        }
        return false;
    }
};