coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 22:38:57 +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/replace-non-coprime-numbers-in-array.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"13.8K\", \"totalAcceptedRaw\": 4462, \"totalSubmissionRaw\": 13777, \"acRate\": \"32.4%\"}",
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"13.8K\", \"totalAcceptedRaw\": 4479, \"totalSubmissionRaw\": 13805, \"acRate\": \"32.4%\"}",
"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.",