2436. Minimum Split Into Subarrays With GCD Greater Than One ============================================================ :题号: 2436 :题名: Minimum Split Into Subarrays With GCD Greater Than One :类型: Premium(元数据占位) :难度: Medium :原题: `LeetCode 2436 `_ :数据源: LeetCode GraphQL :处理状态: 题目文件已建立;题目信息、题目重述与自建示例待下一轮补充。