• Home
• com.github.javadev
• leetcode-in-java
• 1.7
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0901_1000.s0963_minimum_area_rectangle_ii.readme.md Maven / Gradle / Ivy

963\. Minimum Area Rectangle II

Medium

You are given an array of points in the **X-Y** plane `points` where points[i] = [xi, yi].

Return _the minimum area of any rectangle formed from these points, with sides **not necessarily parallel** to the X and Y axes_. If there is not any such rectangle, return `0`.

Answers within 10-5 of the actual answer will be accepted.

**Example 1:**

![](https://assets.leetcode.com/uploads/2018/12/21/1a.png)

**Input:** points = [[1,2],[2,1],[1,0],[0,1]]

**Output:** 2.00000

**Explanation:** The minimum area rectangle occurs at [1,2],[2,1],[1,0],[0,1], with an area of 2.

**Example 2:**

![](https://assets.leetcode.com/uploads/2018/12/22/2.png)

**Input:** points = [[0,1],[2,1],[1,1],[1,0],[2,0]]

**Output:** 1.00000

**Explanation:** The minimum area rectangle occurs at [1,0],[1,1],[2,1],[2,0], with an area of 1.

**Example 3:**

![](https://assets.leetcode.com/uploads/2018/12/22/3.png)

**Input:** points = [[0,3],[1,2],[3,1],[1,3],[2,1]]

**Output:** 0

**Explanation:** There is no possible rectangle to form from these points.

**Constraints:**

*   `1 <= points.length <= 50`
*   `points[i].length == 2`
*   0 <= xi, yi <= 4 * 104
*   All the given points are **unique**.