mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 14:12:17 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>矩形以列表 <code>[x1, y1, x2, y2]</code> 的形式表示,其中 <code>(x1, y1)</code> 为左下角的坐标,<code>(x2, y2)</code> 是右上角的坐标。矩形的上下边平行于 x 轴,左右边平行于 y 轴。</p>\n\n<p>如果相交的面积为 <strong>正</strong> ,则称两矩形重叠。需要明确的是,只在角或边接触的两个矩形不构成重叠。</p>\n\n<p>给出两个矩形 <code>rec1</code> 和 <code>rec2</code> 。如果它们重叠,返回 <code>true</code>;否则,返回 <code>false</code> 。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>rec1 = [0,0,2,2], rec2 = [1,1,3,3]\n<strong>输出:</strong>true\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>rec1 = [0,0,1,1], rec2 = [1,0,2,1]\n<strong>输出:</strong>false\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong>rec1 = [0,0,1,1], rec2 = [2,2,3,3]\n<strong>输出:</strong>false\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>rect1.length == 4</code></li>\n\t<li><code>rect2.length == 4</code></li>\n\t<li><code>-10<sup>9</sup> <= rec1[i], rec2[i] <= 10<sup>9</sup></code></li>\n\t<li><code>rec1</code> 和 <code>rec2</code> 表示一个面积不为零的有效矩形</li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 244,
|
||||
"likes": 245,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Rectangle Area\", \"titleSlug\": \"rectangle-area\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u77e9\\u5f62\\u9762\\u79ef\"}]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"41.5K\", \"totalSubmission\": \"85.8K\", \"totalAcceptedRaw\": 41494, \"totalSubmissionRaw\": 85792, \"acRate\": \"48.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"41.6K\", \"totalSubmission\": \"85.9K\", \"totalAcceptedRaw\": 41553, \"totalSubmissionRaw\": 85900, \"acRate\": \"48.4%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user