leetcode刷题日记——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.

问题分析：这个题同样是判断目标元素是否在数组中。和上题略有不同之处是现在的每行的开头元素不再大于前一行了，但是问题变得更加简单了。我们可以从左上角开始分析。如果目标元素大于当前元素，说明要排除该行，如果目标元素小于当前元素，说明要排除该列，直到找到目标元素或者每行每列都有元素被访问过，总的时间复杂度为O（m+n）,代码理解起来很简单，实现如下：

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