_1774.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1774 {
publicstaticclassSolution1 {
intresult = 0;

publicintclosestCost(int[] baseCosts, int[] toppingCosts, inttarget) {
result = baseCosts[0];
for (inti = 0; i < baseCosts.length; i++) {
recursion(baseCosts[i], toppingCosts, 0, target);
 }
returnresult;
 }

privatevoidrecursion(intcurrentCost, int[] toppingCosts, intindex, inttarget) {
if (Math.abs(currentCost - target) < Math.abs(result - target)
 || (Math.abs(currentCost - target) < Math.abs(result - target)
 && currentCost == result)) {
result = currentCost;
 }
if (index == toppingCosts.length || currentCost == target) {
return;
 }
recursion(currentCost, toppingCosts, index + 1, target);
recursion(currentCost + toppingCosts[index], toppingCosts, index + 1, target);
recursion(currentCost + toppingCosts[index] * 2, toppingCosts, index + 1, target);
 }
 }
}