1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 452,
"dislikes": 34,
"likes": 469,
"dislikes": 36,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Patching Array\", \"titleSlug\": \"patching-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,3]\n[1,1,1,4]\n[1,4,10,3,1]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"18.2K\", \"totalAcceptedRaw\": 9337, \"totalSubmissionRaw\": 18234, \"acRate\": \"51.2%\"}",
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 9685, \"totalSubmissionRaw\": 18735, \"acRate\": \"51.7%\"}",
"hints": [
"If you can make the first x values and you have a value v, then you can make all the values <var>≤ v + x</var>",
"Sort the array of coins. You can always make the value 0 so you can start with x = 0.",