标签:piece bar Divide int sum chocolate Chocolate sweetness LeetCode
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.
Solution
将巧克力分为 \(k+1\) 份,其中你得到的是最小的那部分,问最大可能的这部分是多少。
我们二分答案:每次对当前的答案进行 \(check\),也就是看是否能够分成 \(k+1\) 份
点击查看代码
class Solution {
private:
bool check(vector<int>& sw, int cand, int k){
int sum=0;
for(auto ele:sw){
sum+=ele;
if(sum>=cand){
k--;
if(k==0)return true;
sum=0;
}
}
return false;
}
public:
int maximizeSweetness(vector<int>& sweetness, int k) {
k++;
int n = sweetness.size();
int l = 0,r=0;
for(int i=0;i<n;i++)r+=sweetness[i];
int ans=0;
while(l<=r){
int mid = (r-l)/2+l;
if(check(sweetness, mid, k)){
ans=mid;
l=mid+1;
}
else r=mid-1;
}
return ans;
}
};
标签:piece,bar,Divide,int,sum,chocolate,Chocolate,sweetness,LeetCode 来源: https://www.cnblogs.com/xinyu04/p/16701798.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。