每次思考都是一次进步
1、简单做法,一行一行的去做二分查找。
class Solution {
public:
int countNegatives(vector<vector<int>>& grid) {
int thesize=grid.size();
int count=0;
for(int row=0;row<thesize;++row)
{
int l=0,r=grid[row].size()-1,mid;
while(l<r)
{
mid=l+(r-l)/2;
if(grid[row][mid]>=0) l=mid+1;
else if(grid[row][mid]<0) r=mid;
}
if(l<=grid[row].size()-1&&grid[row][l]<0)
{
count+=grid[row].size()-l;
}
}
return count;
}
};