LeetCode 74. Search a 2D Matrix

描述

解决

class Solution {
public:
bool searchMatrix(const vector<vector<int>>& matrix, int target) {
int r = matrix.size();
if (!r)
return false;
int c = r ? matrix[0].size() : 0;
int st = 0, ed = r * c - 1;
while (st < ed)
{
int m = st + ((ed - st) >> 1);
// cout << m << endl;
int x = m / c, y = m % c;
if (matrix[x][y] == target)
{
return true;
}
else if (matrix[x][y] < target)
st = m + 1;
else
ed = m - 1;
}
if (matrix[st / c][st % c] == target)
return true;
return false;
}
};