coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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/[no content]minimum-split-into-subarrays-with-gcd-greater-than-one.json
View File

@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1836, \"totalSubmissionRaw\": 2544, \"acRate\": \"72.2%\"}",
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1837, \"totalSubmissionRaw\": 2545, \"acRate\": \"72.2%\"}",
"hints": [
"How does the GCD of an array change when you add more elements to a subarray?",
"The GCD will always decrease when increasing the size of the subarray,",