1043. Partition Array for Maximum Sum

https://leetcode.com/problems/partition-array-for-maximum-sum/

solution

时间复杂度：O() 空间复杂度：O()

follow up

410. Split Array Largest Sum