leetcode1351

import bisect
class Solution:
    def countNegatives(self, grid: 'List[List[int]]') -> int:
        m = len(grid)
        n = len(grid[0])
        sums = 0
        for i in range(m):
            aryi = grid[i][::-1]
            index = bisect.bisect_right(aryi,-1)
            if index == n:
                sums += (m - i) * n
                break
            sums += index
        return sums

使用二分查找加速，时间复杂度O(m * logn)。