Leetcode 939. Minimum Area Rectangle

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

1. Description

Minimum Area Rectangle

2. Solution

  • Version 1
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/

你可能感兴趣的:(Leetcode 939. Minimum Area Rectangle)