Package g0901_1000.s0939_minimum_area_rectangle

Class Solution

java.lang.Object

g0901_1000.s0939_minimum_area_rectangle.Solution

public class Solution
extends Object

939 - Minimum Area Rectangle.<p>Medium</p> <p>You are given an array of points in the <strong>X-Y</strong> plane <code>points</code> where <code>points[i] = [x_i, y_i]</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><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/08/03/rec1.JPG" alt="" /></p> <p><strong>Input:</strong> points = [[1,1],[1,3],[3,1],[3,3],[2,2]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/08/03/rec2.JPG" alt="" /></p> <p><strong>Input:</strong> points = [[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]</p> <p><strong>Output:</strong> 2</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= points.length <= 500</code></li> <li><code>points[i].length == 2</code></li> <li><code>0 <= x_i, y_i <= 4 * 10⁴</code></li> <li>All the given points are <strong>unique</strong>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minAreaRect(int[][] points)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minAreaRect

public int minAreaRect(int[][] points)