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/check-if-array-pairs-are-divisible-by-k.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"34.2K\", \"totalAcceptedRaw\": 13756, \"totalSubmissionRaw\": 34194, \"acRate\": \"40.2%\"}",
"stats": "{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"34.2K\", \"totalAcceptedRaw\": 13758, \"totalSubmissionRaw\": 34197, \"acRate\": \"40.2%\"}",
"hints": [
"Keep an array of the frequencies of ((x % k) + k) % k for each x in arr.",
"for each i in [0, k - 1] we need to check if freq[k] == freq[k - i]",