mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-22 05:26:46 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给你个整数数组 <code>arr</code>,其中每个元素都 <strong>不相同</strong>。</p>\n\n<p>请你找到所有具有最小绝对差的元素对,并且按升序的顺序返回。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre><strong>输入:</strong>arr = [4,2,1,3]\n<strong>输出:</strong>[[1,2],[2,3],[3,4]]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre><strong>输入:</strong>arr = [1,3,6,10,15]\n<strong>输出:</strong>[[1,3]]\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre><strong>输入:</strong>arr = [3,8,-10,23,19,-4,-14,27]\n<strong>输出:</strong>[[-14,-10],[19,23],[23,27]]\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>2 <= arr.length <= 10^5</code></li>\n\t<li><code>-10^6 <= arr[i] <= 10^6</code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 60,
|
||||
"likes": 61,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"30.1K\", \"totalAcceptedRaw\": 20531, \"totalSubmissionRaw\": 30094, \"acRate\": \"68.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"31K\", \"totalAcceptedRaw\": 21156, \"totalSubmissionRaw\": 31027, \"acRate\": \"68.2%\"}",
|
||||
"hints": [
|
||||
"Find the minimum absolute difference between two elements in the array.",
|
||||
"The minimum absolute difference must be a difference between two consecutive elements in the sorted array."
|
||||
|
Reference in New Issue
Block a user