coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/smallest-string-with-a-given-numeric-value.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1502,
"dislikes": 48,
"likes": 1526,
"dislikes": 50,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "3\n27\n5\n73",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"78.4K\", \"totalSubmission\": \"117K\", \"totalAcceptedRaw\": 78419, \"totalSubmissionRaw\": 117033, \"acRate\": \"67.0%\"}",
"stats": "{\"totalAccepted\": \"79.4K\", \"totalSubmission\": \"118.4K\", \"totalAcceptedRaw\": 79374, \"totalSubmissionRaw\": 118423, \"acRate\": \"67.0%\"}",
"hints": [
"Think greedily.",
"If you build the string from the end to the beginning, it will always be optimal to put the highest possible character at the current index."