2436-minimum-split-into-subarrays-with-gcd-greater-than-one.adoc

2436. Minimum Split Into Subarrays With GCD Greater Than One

{leetcode}/problems/minimum-split-into-subarrays-with-gcd-greater-than-one/[LeetCode - 2436. Minimum Split Into Subarrays With GCD Greater Than One ^]

思路分析

一刷

link:{sourcedir}/_2436_MinimumSplitIntoSubarraysWithGcdGreaterThanOne.java[role=include]

参考资料