minimum-area-rectangle

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array of points in the X-Y plane <code>points</code> where <code>points[i] = [xi, yi]</code>.

Return the minimum area of a rectangle formed from these points, with sides parallel to the X and Y axes. If there is not any such rectangle, return <code>0</code>.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/08/03/rec1.JPG" style="width: 500px; height: 447px;" />
<pre>
Input: points = [[1,1],[1,3],[3,1],[3,3],[2,2]]
Output: 4
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/08/03/rec2.JPG" style="width: 500px; height: 477px;" />
<pre>
Input: points = [[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
Output: 2
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= points.length &lt;= 500</code></li>
	<li><code>points[i].length == 2</code></li>
	<li><code>0 &lt;= xi, yi &lt;= 4 * 104</code></li>
	<li>All the given points are unique.</li>
</ul>

minAreaRect

Minimum Area Rectangle

Minimum Rectangles to Cover Points

minimum-rectangles-to-cover-points

覆盖所有点的最少矩形数目

Maximum Area Rectangle With Point Constraints I

maximum-area-rectangle-with-point-constraints-i

用点构造面积最大的矩形 I

Maximum Area Rectangle With Point Constraints II

maximum-area-rectangle-with-point-constraints-ii

用点构造面积最大的矩形 II

Geometry

Array

Hash Table

Math

Sorting

给定在 xy 平面上的一组点，确定由这些点组成的矩形的最小面积，其中矩形的边平行于 x 轴和 y 轴。

如果没有任何矩形，就返回 0。

&nbsp;

示例 1：

<pre>输入：[[1,1],[1,3],[3,1],[3,3],[2,2]]
输出：4
</pre>

示例 2：

<pre>输入：[[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
输出：2
</pre>

&nbsp;

提示：

<ol>
	<li><code>1 &lt;= points.length &lt;= 500</code></li>
	<li><code>0 &lt;=&nbsp;points[i][0] &lt;=&nbsp;40000</code></li>
	<li><code>0 &lt;=&nbsp;points[i][1] &lt;=&nbsp;40000</code></li>
	<li>所有的点都是不同的。</li>
</ol>