- 最接近目标价格的甜点成本
周赛期间暴力搜索没做出来,方法选错了,没能找出所有情况。
参考了题解,用dfs进行全搜索。
class Solution {
public:
int ans=INT_MAX;
void dfs(vector<int>& toppingCosts, int p,int target,int sums){
int diffsum=abs(sums-target),diffans=abs(ans-target);
if(diffsum>diffans&&sums>ans) return ;
else if(diffsum==diffans&&sums<ans) ans=sums;
else if(diffsum<diffans) ans=sums;
for(int i=p;i<toppingCosts.size();++i){
if(i>0 && toppingCosts[i-1]==toppingCosts[i]) continue;
dfs(toppingCosts,i+1,target,sums);
dfs(toppingCosts,i+1,target,sums+toppingCosts[i]);
dfs(toppingCosts,i+1,target,sums+toppingCosts[i]*2);
}
}
int closestCost(vector<int>& baseCosts, vector<int>& toppingCosts, int target) {
int n=baseCosts.size();
int m=toppingCosts.size();
int sums=0;
for(int i=0;i<n;++i){
sums=baseCosts[i];
dfs(toppingCosts,0,target,sums);
}
return ans;
}
};