1
class Solution {
2
  public boolean searchMatrix(int[][] matrix, int target) {
3
    if (target < matrix[0][0]) {
4
      return false;
5
    }
6
    for (int i = 0; i < matrix.length; i++) {
7
      if (matrix[i][0] > target | i == matrix.length - 1) {
8
        if (matrix[i][0] > target) {
9
          i--;
10
        }
11
        for (int j = 0; j < matrix[i].length; j++) {
12
          if (matrix[i][j] == target) {
13
            return true;
14
          }
15
        }
16
        return false;
17
      }
18
    }
19
    return false;
20
  }
21
}