Sort the array of prices and use a two-pointer technique to find the two cheapest chocolates that can be bought such that their sum is less than or equal to the given amount of money. This approach helps efficiently find a solution by reducing the problem space through sorting.
Time Complexity: O(n log n) due to sorting.
Space Complexity: O(1) as the sorting is in-place.
1import java.util.Arrays;
2
3public class BuyChocolates {
4 public static int buyTwoChocolates(int[] prices, int money) {
5 Arrays.sort(prices);
6 int left = 0, right = prices.length - 1;
7 int minSpent = Integer.MAX_VALUE;
8
9 while (left < right) {
10 int sum = prices[left] + prices[right];
11 if (sum <= money) {
12 minSpent = sum;
13 left++;
14 } else {
15 right--;
16 }
17 }
18 return (minSpent == Integer.MAX_VALUE) ? money : money - minSpent;
19 }
20
21 public static void main(String[] args) {
22 int[] prices = {1, 2, 2};
23 int money = 3;
24 System.out.println(buyTwoChocolates(prices, money));
25 }
26}Java's Arrays.sort() is used for initial sorting. Two pointers iterate to minimize the sum of the chosen chocolates. Depending on the sum comparison with money, pointers are adjusted for an optimal solution.
In this approach, check all possible pairs of chocolate prices. If a pair's sum is within the available money and minimal, update the result. Although this approach is less efficient, it is a simple and direct way to solve the problem given the constraints.
Time Complexity: O(n^2) due to the nested loop.
Space Complexity: O(1) with a few extra variables.
1def buy_two_chocolates(prices, money):
2 min_spent = money + 1
3 for i in range(len(prices)):
4 for j in range(i + 1, len(prices)):
5 sum_ = prices[i] + prices[j]
6 if sum_ <= money and sum_ < min_spent:
7 min_spent = sum_
8 return money if min_spent > money else money - min_spent
9
10prices = [3, 2, 3]
11money = 3
12print(buy_two_chocolates(prices, money))The brute force Python solution checks possible chocolate pairs to determine minimal spending that fits the budget, iterating via nested loops.