Leetcode 1231: 分享巧克力 Divide Chocolate

中文描述：

你有一个由一些小块组成的巧克力棒。每一小块都有它自己的甜度，由数组sweetness给出。你想要和你的K个朋友分享巧克力，所以你开始切K次把巧克力切成K+1大块，每一大块都由一些连续的小块组成。孔融让梨，你会吃掉那块甜度最少的，然后把其他的分给你的朋友。设计算法优化切巧克力的方法，找出你能得到的最大甜度。

题目描述：

You have one chocolate bar that consists of some chunks. Each chunk has its own sweetness given by the array sweetness.
You want to share the chocolate with your K friends so you start cutting the chocolate bar into K+1 pieces using K cuts, each piece consists of some consecutive chunks.
Being generous, you will eat the piece with the minimum total sweetness and give the other pieces to your friends.
Find the maximum total sweetness of the piece you can get by cutting the chocolate bar optimally.

Example 1:

Input: sweetness = [1,2,3,4,5,6,7,8,9], K = 5
Output: 6
Explanation: You can divide the chocolate to [1,2,3], [4,5], [6], [7], [8], [9]

Example 2:

Input: sweetness = [5,6,7,8,9,1,2,3,4], K = 8
Output: 1
Explanation: There is only one way to cut the bar into 9 pieces.

Example 3:

Input: sweetness = [1,2,2,1,2,2,1,2,2], K = 2
Output: 5
Explanation: You can divide the chocolate to [1,2,2], [1,2,2], [1,2,2]

Constraints:

0 <= K < sweetness.length <= 10⁴
1 <= sweetness[i] <= 10⁵

Time complexity: $O$(