Leetcode 939. Minimum Area Rectangle

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

1. Description

2. Solution

• Version 1

代码语言：javascript复制

class Solution:
    def minAreaRect(self, points):
        result = 0
        stat = set(map(tuple, points))

        for x1, y1 in points:
            for x2, y2 in points:
                if x1 == x2 or y1 == y2:
                    continue
                if (x1, y2) in stat and (x2, y1) in stat:
                    area = abs(x2 - x1) * abs(y2 - y1)
                    if area < result or result == 0:
                        result = area
        return result

Reference

1. https://leetcode.com/problems/minimum-area-rectangle/

sdn com version 博客

0 人点赞