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/make-k-subarray-sums-equal.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"7.7K\", \"totalAcceptedRaw\": 3085, \"totalSubmissionRaw\": 7732, \"acRate\": \"39.9%\"}",
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"7.7K\", \"totalAcceptedRaw\": 3087, \"totalSubmissionRaw\": 7734, \"acRate\": \"39.9%\"}",
"hints": [
"Think about gcd(n, k). How will it help to calculate the answer?",
"indices i and j are in the same group if gcd(n, k) mod i = gcd(n, k) mod j. Each group should have equal elements. Think about the minimum number of operations for each group",