coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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

2
leetcode-cn/originData/minimum-operations-to-make-a-special-number.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 5414, \"totalSubmissionRaw\": 13115, \"acRate\": \"41.3%\"}",
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 5415, \"totalSubmissionRaw\": 13116, \"acRate\": \"41.3%\"}",
"hints": [
"If <code>num</code> contains a single zero digit then the answer is at most <code>n - 1</code>.",
"A number is divisible by <code>25</code> if its last two digits are <code>75</code>, <code>50</code>, <code>25</code>, or <code>00</code>.",