coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-03 14:32:54 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/sum-of-mutated-array-closest-to-target.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 718,
"likes": 720,
"dislikes": 89,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"56.2K\", \"totalAcceptedRaw\": 23893, \"totalSubmissionRaw\": 56212, \"acRate\": \"42.5%\"}",
"stats": "{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"56.3K\", \"totalAcceptedRaw\": 23915, \"totalSubmissionRaw\": 56260, \"acRate\": \"42.5%\"}",
"hints": [
"If you draw a graph with the value on one axis and the absolute difference between the target and the array sum, what will you get?",
"That graph is uni-modal.",