二分查找4（Leetcode1351统计有序矩阵中的负数）

代码：

class Solution {
    public int countNegatives(int[][] grid) {
        int res = 0;
        for(int i=0;i<grid.length;i++){
            int n = grid[i].length;
            if(grid[i][n-1]>=0){
                continue;
            }
            int l=0,r=n-1;
            while(l<r){
                int m = (l+r)/2;
                if(grid[i][m]<0){
                    r=m;
                }else{
                    l=m+1;
                }
            }
            res+=grid[i].length-l;
        }
        return res;
    }
}