1 Star 0 Fork 0

yuhang2__2/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
perfect-rectangle.py 871 Bytes
一键复制 编辑 原始数据 按行查看 历史
# Time: O(n)
# Space: O(n)
from collections import defaultdict
class Solution(object):
def isRectangleCover(self, rectangles):
"""
:type rectangles: List[List[int]]
:rtype: bool
"""
left = min(rec[0] for rec in rectangles)
bottom = min(rec[1] for rec in rectangles)
right = max(rec[2] for rec in rectangles)
top = max(rec[3] for rec in rectangles)
points = defaultdict(int)
for l, b, r, t in rectangles:
for p, q in zip(((l, b), (r, b), (l, t), (r, t)), (1, 2, 4, 8)):
if points[p] & q:
return False
points[p] |= q
for px, py in points:
if left < px < right or bottom < py < top:
if points[(px, py)] not in (3, 5, 10, 12, 15):
return False
return True
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/yuhang2__2/LeetCode-Solutions.git
git@gitee.com:yuhang2__2/LeetCode-Solutions.git
yuhang2__2
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助