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

2
leetcode-cn/originData/max-consecutive-ones.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"223K\", \"totalSubmission\": \"365.1K\", \"totalAcceptedRaw\": 222962, \"totalSubmissionRaw\": 365116, \"acRate\": \"61.1%\"}",
"stats": "{\"totalAccepted\": \"223K\", \"totalSubmission\": \"365.2K\", \"totalAcceptedRaw\": 223005, \"totalSubmissionRaw\": 365188, \"acRate\": \"61.1%\"}",
"hints": [
"You need to think about two things as far as any window is concerned. One is the starting point for the window. How do you detect that a new window of 1s has started? The next part is detecting the ending point for this window.\r\n\r\nHow do you detect the ending point for an existing window? If you figure these two things out, you will be able to detect the windows of consecutive ones. All that remains afterward is to find the longest such window and return the size."
],