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

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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"109K\", \"totalSubmission\": \"140.9K\", \"totalAcceptedRaw\": 109007, \"totalSubmissionRaw\": 140871, \"acRate\": \"77.4%\"}",
"stats": "{\"totalAccepted\": \"109K\", \"totalSubmission\": \"140.9K\", \"totalAcceptedRaw\": 109043, \"totalSubmissionRaw\": 140913, \"acRate\": \"77.4%\"}",
"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."