coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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-iii.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"145K\", \"totalSubmission\": \"244.5K\", \"totalAcceptedRaw\": 144970, \"totalSubmissionRaw\": 244461, \"acRate\": \"59.3%\"}",
"stats": "{\"totalAccepted\": \"145K\", \"totalSubmission\": \"244.5K\", \"totalAcceptedRaw\": 144983, \"totalSubmissionRaw\": 244481, \"acRate\": \"59.3%\"}",
"hints": [
"One thing's for sure, we will only flip a zero if it extends an existing window of 1s. Otherwise, there's no point in doing it, right? Think Sliding Window!",
"Since we know this problem can be solved using the sliding window construct, we might as well focus in that direction for hints. Basically, in a given window, we can never have > K zeros, right?",