Maximum Ice Cream Bars LeetCode solution in Python

1
class Solution:
2
    def maxIceCream(self, costs: List[int], coins: int) -> int:
3
        costs.sort()
4
        i = 0
5
        for price in costs:
6
            if price <= coins:
7
                i += 1
8
                coins -= price
9
            else:
10
                break
11
        return i