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