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

4
leetcode/originData/longer-contiguous-segments-of-ones-than-zeros.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 277,
"likes": 282,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Max Consecutive Ones\", \"titleSlug\": \"max-consecutive-ones\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Count Subarrays With More Ones Than Zeros\", \"titleSlug\": \"count-subarrays-with-more-ones-than-zeros\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Check if Binary String Has at Most One Segment of Ones\", \"titleSlug\": \"check-if-binary-string-has-at-most-one-segment-of-ones\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"27.6K\", \"totalSubmission\": \"45.9K\", \"totalAcceptedRaw\": 27617, \"totalSubmissionRaw\": 45891, \"acRate\": \"60.2%\"}",
"stats": "{\"totalAccepted\": \"28.3K\", \"totalSubmission\": \"46.9K\", \"totalAcceptedRaw\": 28281, \"totalSubmissionRaw\": 46925, \"acRate\": \"60.3%\"}",
"hints": [
"Check every possible segment of 0s and 1s.",
"Is there a way to iterate through the string to keep track of the current character and its count?"