class Solution {
public:
/**
* @param matrix: A list of lists of integers
* @param target: An integer you want to search in matrix
* @return: An integer indicate the total occurrence of target in the given matrix
*/
int searchMatrix(vector<vector<int>> &matrix, int target) {
// write your code here
if (matrix.empty())
{
return 0;
}
int result=0;
int rowSize=matrix.size();
int colSize=matrix[0].size();
if (target<matrix[0][0]||target>matrix[rowSize-1][colSize-1])
{
return result;
}
for (int i=0;i<rowSize;i++)
{
int begin=0,end=colSize-1,mid=begin+end/2;
while(begin<=end)
{
if (target==matrix[i][mid])
{
++result;
break;
}
else if (target<matrix[i][mid])
{
end=mid-1;
mid=(begin+end)/2;
}
else
{
begin=mid+1;
mid=(begin+end)/2;
}
}
}
return result;
}
};
class Solution {
public:
/**
* @param matrix: A list of lists of integers
* @param target: An integer you want to search in matrix
* @return: An integer indicate the total occurrence of target in the given matrix
*/
int searchMatrix(vector<vector<int>> &matrix, int target) {
// write your code here
if (matrix.empty())
{
return 0;
}
int result=0;
int rowSize=matrix.size();
int colSize=matrix[0].size();
if (target<matrix[0][0]||target>matrix[rowSize-1][colSize-1])
{
return result;
}
int i=0,j=colSize-1;
while(i>=0&&i<rowSize&&j>=0&&j<colSize)
{
if (matrix[i][j]==target)
{
++result;
++i;
--j;
}
else if (matrix[i][j]<target)
{
++i;
}
else
{
--j;
}
}
return result;
}
};