coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 16:31:42 +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/replace-non-coprime-numbers-in-array.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"17K\", \"totalAcceptedRaw\": 5953, \"totalSubmissionRaw\": 17022, \"acRate\": \"35.0%\"}",
"stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"17K\", \"totalAcceptedRaw\": 5954, \"totalSubmissionRaw\": 17024, \"acRate\": \"35.0%\"}",
"hints": [
"Notice that the order of merging two numbers into their LCM does not matter so we can greedily merge elements to its left if possible.",
"If a new value is formed, we should recursively check if it can be merged with the value to its left.",