1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 22:13:28 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给定在 xy 平面上的一组点,确定由这些点组成的任何矩形的最小面积,其中矩形的边<strong>不一定平行于</strong> x 轴和 y 轴。</p>\n\n<p>如果没有任何矩形,就返回 0。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<p><strong><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/22/1a.png\" style=\"height: 151px; width: 150px;\"></strong></p>\n\n<pre><strong>输入:</strong>[[1,2],[2,1],[1,0],[0,1]]\n<strong>输出:</strong>2.00000\n<strong>解释:</strong>最小面积的矩形出现在 [1,2],[2,1],[1,0],[0,1] 处,面积为 2。</pre>\n\n<p><strong>示例 2</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/23/2.png\" style=\"height: 94px; width: 150px;\"></p>\n\n<pre><strong>输入:</strong>[[0,1],[2,1],[1,1],[1,0],[2,0]]\n<strong>输出:</strong>1.00000\n<strong>解释:</strong>最小面积的矩形出现在 [1,0],[1,1],[2,1],[2,0] 处,面积为 1。\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/23/3.png\" style=\"height: 94px; width: 150px;\"></p>\n\n<pre><strong>输入:</strong>[[0,3],[1,2],[3,1],[1,3],[2,1]]\n<strong>输出:</strong>0\n<strong>解释:</strong>没法从这些点中组成任何矩形。\n</pre>\n\n<p><strong>示例 4</strong></p>\n\n<p><strong><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/21/4c.png\" style=\"height: 155px; width: 160px;\"></strong></p>\n\n<pre><strong>输入:</strong>[[3,1],[1,1],[0,1],[2,1],[3,3],[3,2],[0,2],[2,3]]\n<strong>输出:</strong>2.00000\n<strong>解释:</strong>最小面积的矩形出现在 [2,1],[2,3],[3,3],[3,1] 处,面积为 2。\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ol>\n\t<li><code>1 &lt;= points.length &lt;= 50</code></li>\n\t<li><code>0 &lt;=&nbsp;points[i][0] &lt;=&nbsp;40000</code></li>\n\t<li><code>0 &lt;=&nbsp;points[i][1] &lt;=&nbsp;40000</code></li>\n\t<li>所有的点都是不同的。</li>\n\t<li>与真实值误差不超过 <code>10^-5</code>&nbsp;的答案将视为正确结果。</li>\n</ol>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 56,
"likes": 57,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"5.7K\", \"totalAcceptedRaw\": 2887, \"totalSubmissionRaw\": 5657, \"acRate\": \"51.0%\"}",
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 2936, \"totalSubmissionRaw\": 5762, \"acRate\": \"51.0%\"}",
"hints": [],
"solution": {
"id": "133",