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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 335,
"likes": 337,
"dislikes": 14,
"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}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"37.4K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 37370, \"totalSubmissionRaw\": 47862, \"acRate\": \"78.1%\"}",
"stats": "{\"totalAccepted\": \"37.5K\", \"totalSubmission\": \"48.1K\", \"totalAcceptedRaw\": 37544, \"totalSubmissionRaw\": 48107, \"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."