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/count-of-interesting-subarrays.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.1K\", \"totalSubmission\": \"35.4K\", \"totalAcceptedRaw\": 12144, \"totalSubmissionRaw\": 35410, \"acRate\": \"34.3%\"}",
"stats": "{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"35.4K\", \"totalAcceptedRaw\": 12151, \"totalSubmissionRaw\": 35428, \"acRate\": \"34.3%\"}",
"hints": [
"The problem can be solved using prefix sums.",
"Let <code>count[i]</code> be the number of indices where <code>nums[i] % modulo == k</code> among the first <code>i</code> indices.",