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.

题目如上。虽然是矩阵，但确实排好序了，只要选定一个方向前进，遇到障碍（当前数字大于所寻找的数），则转向。

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