1
class Solution {
2
 public:
3
  bool searchMatrix(vector<vector<int>> &matrix, int target) {
4
    for (int i = 0; i < matrix.size(); i++) {
5
      if (matrix[i][0] > target) return false;
6
      for (int j = 0; j < matrix[i].size(); j++) {
7
        if (matrix[i][j] == target)
8
          return true;
9
        else if (matrix[i][j] > target)
10
          break;
11
      }
12
    }
13
    return false;
14
  }
15
};