题目描述:
示例 1:
示例 2:
示例 3:
思路:
实现:
class Solution {
public int maxIceCream(int[] costs, int coins) {
int len = costs.length;
Arrays.sort(costs);
int sum = 0;
int i = 0;
for (i = 0; i < len; i++) {
if (sum + costs[i] <= coins) {
sum += costs[i];
} else {
break;
}
}
return i;
}
}