Description
It is a sweltering summer day, and a boy wants to buy some ice cream bars.
At the store, there are n ice cream bars. You are given an array costs of length n, where costs[i] is the price of the ith ice cream bar in coins. The boy initially has coins coins to spend, and he wants to buy as many ice cream bars as possible.
Note: The boy can buy the ice cream bars in any order.
Return the maximum number of ice cream bars the boy can buy with coins coins.
You must solve the problem by counting sort.
Example 1:
Input: costs = [1,3,2,4,1], coins = 7 Output: 4 Explanation: The boy can buy ice cream bars at indices 0,1,2,4 for a total price of 1 + 3 + 2 + 1 = 7.
Example 2:
Input: costs = [10,6,8,7,7,8], coins = 5 Output: 0 Explanation: The boy cannot afford any of the ice cream bars.
Example 3:
Input: costs = [1,6,3,1,2,5], coins = 20 Output: 6 Explanation: The boy can buy all the ice cream bars for a total price of 1 + 6 + 3 + 1 + 2 + 5 = 18.
Constraints:
costs.length == n1 <= n <= 1051 <= costs[i] <= 1051 <= coins <= 108
Solutions
Attempt at performance improvements #3.
Language: javascript(2026-06-21 07:49)DONE
CPU Performance86.36%
Memory Performance6.82%
/**
* @param {number[]} costs
* @param {number} coins
* @return {number}
*/
var maxIceCream = function(costs, coins) {
const n = costs.length;
let min = Infinity;
let max = -Infinity;
let total = 0;
for (const cost of costs) {
if (cost < min) min = cost;
if (cost > max) max = cost;
total += cost;
}
if (coins >= total) {
return n;
}
const arr = new Array(max - min + 1).fill(0);
for (const cost of costs) {
arr[cost - min]++;
}
let res = 0;
for (let cost = min; cost <= max; cost++) {
if (cost > coins) break;
const pos = cost - min;
if (arr[pos] === 0) continue;
const usableCoins = Math.min(Math.floor(coins / cost), arr[pos]);
coins -= usableCoins * cost;
res += usableCoins;
}
return res;
};