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/binary-string-with-substrings-representing-1-to-n.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 242,
"dislikes": 450,
"likes": 247,
"dislikes": 453,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"0110\"\n3\n\"0110\"\n4",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"48.5K\", \"totalAcceptedRaw\": 28060, \"totalSubmissionRaw\": 48472, \"acRate\": \"57.9%\"}",
"stats": "{\"totalAccepted\": \"28.5K\", \"totalSubmission\": \"49.3K\", \"totalAcceptedRaw\": 28530, \"totalSubmissionRaw\": 49287, \"acRate\": \"57.9%\"}",
"hints": [
"We only need to check substrings of length at most 30, because 10^9 has 30 bits."
],