LeetCode #240 - 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大于它则向下搜索，若小于它则向左搜索，时间复杂度为O(n)。

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