class Solution:
def maxIceCream(self, costs: List[int], coins: int) -> int:
if coins<min(costs):
return 0
if coins>sum(costs):
return len(costs)
coin=0
costs.sort()
for i,cost in enumerate(costs):
coin+=cost
if coin>coins:
return i
break
if coin==coins:
return i+1
break
leetcode 1833
最新推荐文章于 2021-07-14 22:39:25 发布