Package g1701_1800.s1774_closest_dessert_cost

Class Solution

java.lang.Object

g1701_1800.s1774_closest_dessert_cost.Solution

public class Solution
extends Object

1774 - Closest Dessert Cost.<p>Medium</p> <p>You would like to make dessert and are preparing to buy the ingredients. You have <code>n</code> ice cream base flavors and <code>m</code> types of toppings to choose from. You must follow these rules when making your dessert:</p> <ul> <li>There must be <strong>exactly one</strong> ice cream base.</li> <li>You can add <strong>one or more</strong> types of topping or have no toppings at all.</li> <li>There are <strong>at most two</strong> of <strong>each type</strong> of topping.</li> </ul> <p>You are given three inputs:</p> <ul> <li><code>baseCosts</code>, an integer array of length <code>n</code>, where each <code>baseCosts[i]</code> represents the price of the <code>i^th</code> ice cream base flavor.</li> <li><code>toppingCosts</code>, an integer array of length <code>m</code>, where each <code>toppingCosts[i]</code> is the price of <strong>one</strong> of the <code>i^th</code> topping.</li> <li><code>target</code>, an integer representing your target price for dessert.</li> </ul> <p>You want to make a dessert with a total cost as close to <code>target</code> as possible.</p> <p>Return <em>the closest possible cost of the dessert to</em> <code>target</code>. If there are multiple, return <em>the <strong>lower</strong> one.</em></p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> baseCosts = [1,7], toppingCosts = [3,4], target = 10</p> <p><strong>Output:</strong> 10</p> <p><strong>Explanation:</strong> Consider the following combination (all 0-indexed):</p> <ul> <li> <p>Choose base 1: cost 7</p> </li> <li> <p>Take 1 of topping 0: cost 1 x 3 = 3</p> </li> <li> <p>Take 0 of topping 1: cost 0 x 4 = 0</p> </li> </ul> <p>Total: 7 + 3 + 0 = 10.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> baseCosts = [2,3], toppingCosts = [4,5,100], target = 18</p> <p><strong>Output:</strong> 17</p> <p><strong>Explanation:</strong> Consider the following combination (all 0-indexed): - Choose base 1: cost 3 - Take 1 of topping 0: cost 1 x 4 = 4 - Take 2 of topping 1: cost 2 x 5 = 10 - Take 0 of topping 2: cost 0 x 100 = 0 Total: 3 + 4 + 10 + 0 = 17. You cannot make a dessert with a total cost of 18.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> baseCosts = [3,10], toppingCosts = [2,5], target = 9</p> <p><strong>Output:</strong> 8</p> <p><strong>Explanation:</strong> It is possible to make desserts with cost 8 and 10. Return 8 as it is the lower cost.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == baseCosts.length</code></li> <li><code>m == toppingCosts.length</code></li> <li><code>1 <= n, m <= 10</code></li> <li><code>1 <= baseCosts[i], toppingCosts[i] <= 10⁴</code></li> <li><code>1 <= target <= 10⁴</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	closestCost(int[] baseCosts, int[] toppingCosts, int target)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

closestCost

public int closestCost(int[] baseCosts,
 int[] toppingCosts,
 int target)