leetcode1351

Posted 2021-03-09

鏍囩锛?a href='http://www.mamicode.com/so/1/pre' title='pre'>pre   bisect   import   code   break   solution   浣跨敤   鏌ユ壘   log   

 1 import bisect
 2 class Solution:
 3     def countNegatives(self, grid: 鈥?/span>List[List[int]]鈥?/span>) -> int:
 4         m = len(grid)
 5         n = len(grid[0])
 6         sums = 0
 7         for i in range(m):
 8             aryi = grid[i][::-1]
 9             index = bisect.bisect_right(aryi,-1)
10             if index == n:
11                 sums += (m - i) * n
12                 break
13             sums += index
14         return sums

浣跨敤浜屽垎鏌ユ壘鍔犻€燂紝鏃堕棿澶嶆潅搴(m * logn)銆?/p>