LeetCode/solutions/cpp/0074.cpp at master · SnistAheads/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if (matrix.empty()) return false;

        int l = 0;
        int r = matrix.size() * matrix[0].size();

        while (l < r) {
            int m = (l + r) >> 1;
            int i = m / matrix[0].size();
            int j = m % matrix[0].size();
            if (matrix[i][j] == target) return true;
            if (matrix[i][j] > target)
                r = m;
            else
                l = m + 1;
        }

        return false;
    }
};