Log for 電訊台
表面上向大眾宣揚到好民主
背後咪又係匿埋一處數銀紙
一次一次無理智武器既比試
恐怖主義用恐怖手段處置
極權統治最終邊個話事
人類當棋子佢哋操控期指股市
金融風暴一小撮人當道
每次有事你都走到你既秘密通道
遍佈太多圈套
世界走到最終得到 係咪就咁算數
背後咪又係匿埋一處數銀紙
一次一次無理智武器既比試
恐怖主義用恐怖手段處置
極權統治最終邊個話事
人類當棋子佢哋操控期指股市
金融風暴一小撮人當道
每次有事你都走到你既秘密通道
遍佈太多圈套
世界走到最終得到 係咪就咁算數
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
m, n = len(matrix), len(matrix[0])
x, y = 0, 0
while x != m:
low, high, mid = 0, n - 1, 0
while low <= high:
mid = (high + low) // 2
if matrix[x][mid] < target: low = mid + 1
elif matrix[x][mid] > target: high = mid - 1
else: return True
x += 1
return False無聊做咗今日leetcode
state machine: maintain a pointer from left to right in the row, perform binary search on row, if found then yes, if not advance to next row, if all row is exhausted, impossible to have target
you can do this in column too but its effectively just the same but transposed