解题思路 先进行排序,每次都买最便宜的,直到买不起为止 代码 class Solution { public int maxIceCream(int[] costs, int coins) { Arrays.sort(costs); int n = costs.length,sum = 0; for (int i=0;i<n;i++){ if (coins>=costs[i]){ coins=coins-costs[i]; sum++; }else break; } return sum; } }