[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时，那么这一列就有可能存在于target相等的元素。

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