240 Search a 2D Matrix II

1 题目

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.

2 标准解

2.1 解析

对于matrix[i][j]，所有位于其右下方的元素都大于matrix[i][j]，所有位于其左边、上方或左上方的元素都大于等于matrix[i][j]。利用这个性质，从矩阵的左下角元素出发，如果matrix[i][j]>target，则该行其余元素均大于target，所以可以删去。如果matrix[i][j]<target，则该列其余元素都小于target可以删去。即始终保持当前元素是矩阵的左下角，直到找到target。

2.2 代码

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