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/originData/number-of-zero-filled-subarrays.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"116.3K\", \"totalSubmission\": \"174.5K\", \"totalAcceptedRaw\": 116320, \"totalSubmissionRaw\": 174524, \"acRate\": \"66.6%\"}",
"stats": "{\"totalAccepted\": \"116.3K\", \"totalSubmission\": \"174.6K\", \"totalAcceptedRaw\": 116341, \"totalSubmissionRaw\": 174553, \"acRate\": \"66.7%\"}",
"hints": [
"For each zero, you can calculate the number of zero-filled subarrays that end on that index, which is the number of consecutive zeros behind the current element + 1.",
"Maintain the number of consecutive zeros behind the current element, count the number of zero-filled subarrays that end on each index, sum it up to get the answer."