mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 19:31:42 +08:00
add leetcode problem-cn part3
This commit is contained in:
@@ -0,0 +1,28 @@
|
||||
<p>给定在 xy 平面上的一组点,确定由这些点组成的矩形的最小面积,其中矩形的边平行于 x 轴和 y 轴。</p>
|
||||
|
||||
<p>如果没有任何矩形,就返回 0。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong>[[1,1],[1,3],[3,1],[3,3],[2,2]]
|
||||
<strong>输出:</strong>4
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong>[[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
|
||||
<strong>输出:</strong>2
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示:</strong></p>
|
||||
|
||||
<ol>
|
||||
<li><code>1 <= points.length <= 500</code></li>
|
||||
<li><code>0 <= points[i][0] <= 40000</code></li>
|
||||
<li><code>0 <= points[i][1] <= 40000</code></li>
|
||||
<li>所有的点都是不同的。</li>
|
||||
</ol>
|
Reference in New Issue
Block a user