coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 00:41: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-gcd-equal-to-k.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"19.7K\", \"totalAcceptedRaw\": 8325, \"totalSubmissionRaw\": 19701, \"acRate\": \"42.3%\"}",
"stats": "{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"19.7K\", \"totalAcceptedRaw\": 8332, \"totalSubmissionRaw\": 19711, \"acRate\": \"42.3%\"}",
"hints": [
"The constraints on nums.length are small. It is possible to check every subarray.",
"To calculate GCD, you can use a built-in function or the Euclidean Algorithm."