coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/replace-non-coprime-numbers-in-array.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"19.4K\", \"totalAcceptedRaw\": 6745, \"totalSubmissionRaw\": 19394, \"acRate\": \"34.8%\"}",
"stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"19.5K\", \"totalAcceptedRaw\": 6772, \"totalSubmissionRaw\": 19461, \"acRate\": \"34.8%\"}",
"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.",