mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 22:13:28 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定在 xy 平面上的一组点,确定由这些点组成的矩形的最小面积,其中矩形的边平行于 x 轴和 y 轴。</p>\n\n<p>如果没有任何矩形,就返回 0。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre><strong>输入:</strong>[[1,1],[1,3],[3,1],[3,3],[2,2]]\n<strong>输出:</strong>4\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre><strong>输入:</strong>[[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]\n<strong>输出:</strong>2\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ol>\n\t<li><code>1 <= points.length <= 500</code></li>\n\t<li><code>0 <= points[i][0] <= 40000</code></li>\n\t<li><code>0 <= points[i][1] <= 40000</code></li>\n\t<li>所有的点都是不同的。</li>\n</ol>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 110,
|
||||
"likes": 111,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"6.6K\", \"totalSubmission\": \"14.2K\", \"totalAcceptedRaw\": 6597, \"totalSubmissionRaw\": 14174, \"acRate\": \"46.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"14.5K\", \"totalAcceptedRaw\": 6762, \"totalSubmissionRaw\": 14456, \"acRate\": \"46.8%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user