coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/find-greatest-common-divisor-of-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 337,
"dislikes": 14,
"likes": 358,
"dislikes": 15,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Greatest Common Divisor of Strings\", \"titleSlug\": \"greatest-common-divisor-of-strings\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Number of Different Subsequences GCDs\", \"titleSlug\": \"number-of-different-subsequences-gcds\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Three Divisors\", \"titleSlug\": \"three-divisors\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[2,5,6,9,10]\n[7,5,6,8,3]\n[3,3]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"37.5K\", \"totalSubmission\": \"48.1K\", \"totalAcceptedRaw\": 37544, \"totalSubmissionRaw\": 48107, \"acRate\": \"78.0%\"}",
"stats": "{\"totalAccepted\": \"39.7K\", \"totalSubmission\": \"51K\", \"totalAcceptedRaw\": 39737, \"totalSubmissionRaw\": 50973, \"acRate\": \"78.0%\"}",
"hints": [
"Find the minimum and maximum in one iteration. Let them be mn and mx.",
"Try all the numbers in the range [1, mn] and check the largest number which divides both of them."