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.

这道题从右上角开始遍历，因为每一行每一列都是sorted的，如果target > matrix[row][col]，说明target肯定不在matrix[row][col]所在行的左边，row++；如果target < matrix[row][col]，说明target肯定不在matrix[row][col]所在列的下边，col--；如果target = matrix[row][col]，返回true。代码如下：

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