当前位置: 代码迷 >> 综合 >> Leetcode 939. Minimum Area Rectangle
  详细解决方案

Leetcode 939. Minimum Area Rectangle

热度:91   发布时间:2023-12-12 21:10:30.0

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Minimum Area Rectangle

2. Solution

  • Version 1
class Solution:def minAreaRect(self, points):result = 0stat = set(map(tuple, points))for x1, y1 in points:for x2, y2 in points:if x1 == x2 or y1 == y2:continueif (x1, y2) in stat and (x2, y1) in stat:area = abs(x2 - x1) * abs(y2 - y1)if area < result or result == 0:result = areareturn result

Reference

  1. https://leetcode.com/problems/minimum-area-rectangle/
  相关解决方案