coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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/minimum-operations-to-convert-number.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 335,
"dislikes": 17,
"likes": 350,
"dislikes": 19,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Operations to Reduce X to Zero\", \"titleSlug\": \"minimum-operations-to-reduce-x-to-zero\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[2,4,12]\n2\n12\n[3,5,7]\n0\n-4\n[2,8,16]\n0\n1",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 9349, \"totalSubmissionRaw\": 20354, \"acRate\": \"45.9%\"}",
"stats": "{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"20.8K\", \"totalAcceptedRaw\": 9606, \"totalSubmissionRaw\": 20821, \"acRate\": \"46.1%\"}",
"hints": [
"Once x drops below 0 or goes above 1000, is it possible to continue performing operations on x?",
"How can you use BFS to find the minimum operations?"