Package g2701_2800.s2706_buy_two_chocolates

Class Solution

java.lang.Object

g2701_2800.s2706_buy_two_chocolates.Solution

public class Solution
extends Object

2706 - Buy Two Chocolates.<p>Easy</p> <p>You are given an integer array <code>prices</code> representing the prices of various chocolates in a store. You are also given a single integer <code>money</code>, which represents your initial amount of money.</p> <p>You must buy <strong>exactly</strong> two chocolates in such a way that you still have some <strong>non-negative</strong> leftover money. You would like to minimize the sum of the prices of the two chocolates you buy.</p> <p>Return <em>the amount of money you will have leftover after buying the two chocolates</em>. If there is no way for you to buy two chocolates without ending up in debt, return <code>money</code>. Note that the leftover must be non-negative.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> prices = [1,2,2], money = 3</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> Purchase the chocolates priced at 1 and 2 units respectively. You will have 3 - 3 = 0 units of money afterwards. Thus, we return 0.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> prices = [3,2,3], money = 3</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> You cannot buy 2 chocolates without going in debt, so we return 3.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>2 <= prices.length <= 50</code></li> <li><code>1 <= prices[i] <= 100</code></li> <li><code>1 <= money <= 100</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	buyChoco(int[] prices, int money)

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

buyChoco

public int buyChoco(int[] prices,
 int money)