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-cn/originData/greatest-common-divisor-traversal.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"11.7K\", \"totalAcceptedRaw\": 2915, \"totalSubmissionRaw\": 11726, \"acRate\": \"24.9%\"}",
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"11.7K\", \"totalAcceptedRaw\": 2915, \"totalSubmissionRaw\": 11728, \"acRate\": \"24.9%\"}",
"hints": [
"Create a (prime) factor-numbers list for all the indices.",
"Add an edge between the neighbors of the (prime) factor-numbers list. The order of the numbers doesn’t matter. We only need edges between 2 neighbors instead of edges for all pairs.",