推 JIWP: 你好厲害 12/11 23:47
推 sixB: 我好崇拜你 12/11 23:50
記下每個軸上的最大最小值
如果有在這之間 就中了
def countCoveredBuildings(self, n: int, buildings: List[List[int]]) -> int:
x_mp = defaultdict()
y_mp = defaultdict()
for bld in buildings:
if bld[0] not in x_mp:
x_mp[bld[0]] = [bld[1], bld[1]]
else:
x_mp[bld[0]][0] = min(x_mp[bld[0]][0], bld[1])
x_mp[bld[0]][1] = max(x_mp[bld[0]][1], bld[1])
if bld[1] not in y_mp:
y_mp[bld[1]] = [bld[0], bld[0]]
else:
y_mp[bld[1]][0] = min(y_mp[bld[1]][0], bld[0])
y_mp[bld[1]][1] = max(y_mp[bld[1]][1], bld[0])
rets = 0
for bld in buildings:
if x_mp[bld[0]][0] < bld[1] < x_mp[bld[0]][1] and y_mp[bld[1]][0] <
bld[0] < y_mp[bld[1]][1]:
rets += 1
return rets
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 220.132.58.28 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1765468027.A.4AC.html