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

4
leetcode/originData/partition-string-into-minimum-beautiful-substrings.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 291,
"likes": 293,
"dislikes": 8,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Partition Array for Maximum Sum\", \"titleSlug\": \"partition-array-for-maximum-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"24.2K\", \"totalAcceptedRaw\": 12568, \"totalSubmissionRaw\": 24207, \"acRate\": \"51.9%\"}",
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"24.2K\", \"totalAcceptedRaw\": 12573, \"totalSubmissionRaw\": 24215, \"acRate\": \"51.9%\"}",
"hints": [
"To check if number x is a power of 5 or not, we will divide x by 5 while x > 1 and x mod 5 == 0. After iteration if x == 1, then it was a power of 5.",
"Since the constraint of s.length is small, we can use recursion to find all the partitions."