find-the-minimum-area-to-cover-all-ones-i

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 a 2D binary array <code>grid</code>. Find a rectangle with horizontal and vertical sides with the smallest area, such that all the 1&#39;s in <code>grid</code> lie inside this rectangle.

Return the minimum possible area of the rectangle.

&nbsp;
Example 1:

<div class="example-block">
Input: grid = [[0,1,0],[1,0,1]]

Output: 6

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/05/08/examplerect0.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 279px; height: 198px;" />

The smallest rectangle has a height of 2 and a width of 3, so it has an area of <code>2 * 3 = 6</code>.
</div>

Example 2:

<div class="example-block">
Input: grid = [[1,0],[0,0]]

Output: 1

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/05/08/examplerect1.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 204px; height: 201px;" />

The smallest rectangle has both height and width 1, so its area is <code>1 * 1 = 1</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= grid.length, grid[i].length &lt;= 1000</code></li>
	<li><code>grid[i][j]</code> is either 0 or 1.</li>
	<li>The input is generated such that there is at least one 1 in <code>grid</code>.</li>
</ul>

minimumArea

Find the Minimum Area to Cover All Ones I

Smallest Rectangle Enclosing Black Pixels

smallest-rectangle-enclosing-black-pixels

包含全部黑色像素的最小矩形

Array

Matrix

给你一个二维 二进制 数组 <code>grid</code>。请你找出一个边在水平方向和竖直方向上、面积 最小 的矩形，并且满足 <code>grid</code> 中所有的 1 都在矩形的内部。

返回这个矩形可能的 最小 面积。

&nbsp;

示例 1：

<div class="example-block">
输入： grid = [[0,1,0],[1,0,1]]

输出： 6

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/05/08/examplerect0.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 279px; height: 198px;" />

这个最小矩形的高度为 2，宽度为 3，因此面积为 <code>2 * 3 = 6</code>。
</div>

示例 2：

<div class="example-block">
输入： grid = [[0,0],[1,0]]

输出： 1

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/05/08/examplerect1.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 204px; height: 201px;" />

这个最小矩形的高度和宽度都是 1，因此面积为 <code>1 * 1 = 1</code>。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= grid.length, grid[i].length &lt;= 1000</code></li>
	<li><code>grid[i][j]</code> 是 0 或 1。</li>
	<li>输入保证 <code>grid</code> 中至少有一个 1 。</li>
</ul>