[LeetCode Sync] Runtime - 391 ms (89.79%), Memory - 16.8 MB (72.94%)

Author: Wayne0758

Wayne0758/leetcode/0976-minimum-area-rectangle/README.md

@@ -0,0 +1,28 @@
+<p>You are given an array of points in the <strong>X-Y</strong> plane <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code>.</p>
+
+<p>Return <em>the minimum area of a rectangle formed from these points, with sides parallel to the X and Y axes</em>. If there is not any such rectangle, return <code>0</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/08/03/rec1.JPG" style="width: 500px; height: 447px;" />
+<pre>
+<strong>Input:</strong> points = [[1,1],[1,3],[3,1],[3,3],[2,2]]
+<strong>Output:</strong> 4
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/08/03/rec2.JPG" style="width: 500px; height: 477px;" />
+<pre>
+<strong>Input:</strong> points = [[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
+<strong>Output:</strong> 2
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= points.length &lt;= 500</code></li>
+	<li><code>points[i].length == 2</code></li>
+	<li><code>0 &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 4 * 10<sup>4</sup></code></li>
+	<li>All the given points are <strong>unique</strong>.</li>
+</ul>

Wayne0758/leetcode/0976-minimum-area-rectangle/solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def minAreaRect(self, points: List[List[int]]) -> int:
+        hashmap = collections.defaultdict(set)
+        for point in points:
+            hashmap[point[0]].add(point[1])
+        dict_x = {x: set_y for x, set_y in hashmap.items() if len(set_y) > 1}
+        min_area = float('inf')
+        for x1, x2 in combinations(dict_x.keys(), 2):
+            for y1, y2 in combinations(dict_x[x1] & dict_x[x2], 2):
+                min_area = min(min_area, abs(x1 - x2) * abs(y1 - y2))
+        return min_area if min_area < float('inf') else 0