coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 08:51:42 +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/number-of-subarrays-with-lcm-equal-to-k.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.5K\", \"totalSubmission\": \"20.6K\", \"totalAcceptedRaw\": 8458, \"totalSubmissionRaw\": 20642, \"acRate\": \"41.0%\"}",
"stats": "{\"totalAccepted\": \"8.5K\", \"totalSubmission\": \"20.6K\", \"totalAcceptedRaw\": 8461, \"totalSubmissionRaw\": 20647, \"acRate\": \"41.0%\"}",
"hints": [
"The constraints on nums.length are small. It is possible to check every subarray.",
"To calculate LCM, you can use a built-in function or the formula lcm(a, b) = a * b / gcd(a, b).",