coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/minimum-absolute-difference-between-elements-with-constraint.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"65K\", \"totalAcceptedRaw\": 20874, \"totalSubmissionRaw\": 65032, \"acRate\": \"32.1%\"}",
"stats": "{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"65.1K\", \"totalAcceptedRaw\": 20880, \"totalSubmissionRaw\": 65055, \"acRate\": \"32.1%\"}",
"hints": [
"<div class=\"_1l1MA\">Let's only consider the cases where <code>i < j</code>, as the problem is symmetric.</div>",
"<div class=\"_1l1MA\">For an index <code>j</code>, we are interested in an index <code>i</code> in the range <code>[0, j - x]</code> that minimizes <code>abs(nums[i] - nums[j])</code>.</div>",