coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.6K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 11580, \"totalSubmissionRaw\": 14719, \"acRate\": \"78.7%\"}",
"stats": "{\"totalAccepted\": \"11.6K\", \"totalSubmission\": \"14.8K\", \"totalAcceptedRaw\": 11638, \"totalSubmissionRaw\": 14786, \"acRate\": \"78.7%\"}",
"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."