LeetCode [1231] Divide Chocolate

 1231. Divide Chocolate

Hard

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^4
• 1 <= sweetness[i] <= 10^5

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

class Solution { public int maximizeSweetness(int[] sweetness, int K) { long sum = 0; for(long s : sweetness) sum += s; long l = 1, r = sum; while(l<r){ long mid = l + (long)Math.ceil((r-l)/2.0); System.out.println(l + " " + r); if(!valid(sweetness, K, mid)) { r = mid-1; }else{ l = mid; } } return (int)l; } //return true if consecutive sweetness >= target when dividing into K+1 subarrays boolean valid(int[] sweetness, int K, long target){ int count = 0; long cur = 0; for(long s : sweetness) { if(cur+s<target) { cur += s; }else{ count++; cur = 0; if(count>=K+1) return true; } } return false; } }