coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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

4
leetcode/originData/number-of-subarrays-with-gcd-equal-to-k.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 416,
"likes": 417,
"dislikes": 61,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find Greatest Common Divisor of Array\", \"titleSlug\": \"find-greatest-common-divisor-of-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Number of Subarrays With LCM Equal to K\", \"titleSlug\": \"number-of-subarrays-with-lcm-equal-to-k\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22.8K\", \"totalSubmission\": \"46.2K\", \"totalAcceptedRaw\": 22814, \"totalSubmissionRaw\": 46219, \"acRate\": \"49.4%\"}",
"stats": "{\"totalAccepted\": \"22.8K\", \"totalSubmission\": \"46.2K\", \"totalAcceptedRaw\": 22827, \"totalSubmissionRaw\": 46243, \"acRate\": \"49.4%\"}",
"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."