coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 16:01: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/fancy-sequence.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"31.7K\", \"totalAcceptedRaw\": 5667, \"totalSubmissionRaw\": 31678, \"acRate\": \"17.9%\"}",
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"31.7K\", \"totalAcceptedRaw\": 5669, \"totalSubmissionRaw\": 31682, \"acRate\": \"17.9%\"}",
"hints": [
"Use two arrays to save the cumulative multipliers at each time point and cumulative sums adjusted by the current multiplier.",
"The function getIndex(idx) ask to the current value modulo 10^9+7. Use modular inverse and both arrays to calculate this value."