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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 720,
"dislikes": 89,
"likes": 743,
"dislikes": 90,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[4,9,3]\n10\n[2,3,5]\n10\n[60864,25176,27249,21296,20204]\n56803",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"56.3K\", \"totalAcceptedRaw\": 23915, \"totalSubmissionRaw\": 56260, \"acRate\": \"42.5%\"}",
"stats": "{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"57.9K\", \"totalAcceptedRaw\": 24686, \"totalSubmissionRaw\": 57857, \"acRate\": \"42.7%\"}",
"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.",