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.

思路：因为有重复，上下row的关系没有绝对大小，只能依靠row ascend，col ascend来进行排除一行和一列，从左下角和右上角都可以进行，O(m+n).

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix == null || matrix.length == 0 || matrix[0].length == 0) {
            return false;
        }
        int m = matrix.length;
        int n = matrix[0].length;
        int x = 0; int y = n - 1;
        while(0 <= x && x < m && 0 <= y && y < n) {
            if(matrix[x][y] == target) {
                return true;
            } else if(matrix[x][y] < target) {
                x++;
            } else {
                // matrix[x][y] > target;
                y--;
            }
        }
        return false;
    }
}