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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/minimum-operations-to-convert-number.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 616,
"likes": 617,
"dislikes": 33,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Operations to Reduce X to Zero\", \"titleSlug\": \"minimum-operations-to-reduce-x-to-zero\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"31.2K\", \"totalAcceptedRaw\": 15139, \"totalSubmissionRaw\": 31155, \"acRate\": \"48.6%\"}",
"stats": "{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"31.2K\", \"totalAcceptedRaw\": 15146, \"totalSubmissionRaw\": 31171, \"acRate\": \"48.6%\"}",
"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?"