题目:原题链接(中等)
标签:数组、二分查找
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
---|---|---|---|
Ans 1 (Python) | O ( N l o g N ) O(NlogN) O(NlogN) | O ( 1 ) O(1) O(1) | 112ms (90.38%) |
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一:
class Solution:
def leftMostColumnWithOne(self, binaryMatrix: 'BinaryMatrix') -> int:
m, n = binaryMatrix.dimensions()
left, right = 0, m
while left < right:
mid = (left + right) // 2
find = False
for i in range(m):
if binaryMatrix.get(i, mid) == 1:
find = True
break
if not find:
left = mid + 1
else:
right = mid
return left if left < n else -1