Search-a-2D-Matrix

Search a 2D Matrix

Difficulty:Medium

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 from left to right.
• The first integer of each row is greater than the last integer of the previous row.

For example,

Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target = 3, return true.

Code

Java Runtime: 412 ms

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix == null)
            return false;
        int rowNum = matrix.length;
        int rowLength = matrix[0].length;
        for(int i = 0; i <= rowNum - 1; i++) {
            if(target > matrix[i][rowLength-1])
                continue;
            for(int j = rowLength - 1; j >= 0; j--) {
                if(target == matrix[i][j])
                    return true;
            }
        }
        return false;
    }
}

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

  从右上角开始遍历，若target大于7则向下，否则在第一列遍历,匹配则返回true。时间复杂度 O(n)