g2701_2800.s2706_buy_two_chocolates.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g2701_2800.s2706_buy_two_chocolates;

// #Easy #Array #Sorting #2023_09_14_Time_1_ms_(100.00%)_Space_43_MB_(74.68%)

/**
 * 2706 - Buy Two Chocolates\.
 *
 * Easy
 *
 * You are given an integer array `prices` representing the prices of various chocolates in a store. You are also given a single integer `money`, which represents your initial amount of money.
 *
 * You must buy **exactly** two chocolates in such a way that you still have some **non-negative** leftover money. You would like to minimize the sum of the prices of the two chocolates you buy.
 *
 * Return _the amount of money you will have leftover after buying the two chocolates_. If there is no way for you to buy two chocolates without ending up in debt, return `money`. Note that the leftover must be non-negative.
 *
 * **Example 1:**
 *
 * **Input:** prices = [1,2,2], money = 3
 *
 * **Output:** 0
 *
 * **Explanation:** Purchase the chocolates priced at 1 and 2 units respectively. You will have 3 - 3 = 0 units of money afterwards. Thus, we return 0.
 *
 * **Example 2:**
 *
 * **Input:** prices = [3,2,3], money = 3
 *
 * **Output:** 3
 *
 * **Explanation:** You cannot buy 2 chocolates without going in debt, so we return 3.
 *
 * **Constraints:**
 *
 * *   `2 <= prices.length <= 50`
 * *   `1 <= prices[i] <= 100`
 * *   `1 <= money <= 100`
**/
public class Solution {
    public int buyChoco(int[] prices, int money) {
        int minPrice1 = Integer.MAX_VALUE;
        int minPrice2 = Integer.MAX_VALUE;

        for (int price : prices) {
            if (price < minPrice1) {
                minPrice2 = minPrice1;
                minPrice1 = price;
            } else if (price < minPrice2) {
                minPrice2 = price;
            }
        }

        int totalPrice = minPrice1 + minPrice2;

        if (totalPrice > money) {
            return money;
        } else {
            return money - totalPrice;
        }
    }
}