From 9cee92d538c64f43a3dfc1b25675e006e2ee7b91 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Tue, 5 Aug 2025 10:06:30 +0200 Subject: 3477. fruits into baskets 2 --- fruit_into_baskets2.py | 39 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 fruit_into_baskets2.py (limited to 'fruit_into_baskets2.py') diff --git a/fruit_into_baskets2.py b/fruit_into_baskets2.py new file mode 100644 index 0000000..b16aa48 --- /dev/null +++ b/fruit_into_baskets2.py @@ -0,0 +1,39 @@ +# 3477. Fruits Into Baskets II + +""" +you are given two arrays of integers 'fruits' and 'baskets' each of length +'n', where 'fruits[i]' represents the quantity of the i'th type of fruit, and +'baskets[j]' represents the capacity of the 'j'th basket. from left to right, +place the fruits according to these rules: each fruit type must be place in +the leftmost available basket with a capacity greater than or equal to the +quantity of that fruit type. return the number of fruit types that remain +unplaced after all possible allocations are made. +""" + + +class Solution(object): + def numOfUnplacedFruits(self, fruits, baskets): + """ + :type fruits: List[int] + :type baskets: List[int] + :rtype: int + """ + n = len(fruits) + used = [False] * n + unplaced = 0 + for i in fruits: + placed = False + for j in range(n): + if not used[j] and baskets[j] >= i: + used[j] = True + placed = True + break + if not placed: + unplaced += 1 + return unplaced + + +if __name__ == "__main__": + obj = Solution() + print(obj.numOfUnplacedFruits(fruits=[4, 2, 5], baskets=[3, 5, 4])) + print(obj.numOfUnplacedFruits(fruits=[3, 6, 1], baskets=[6, 4, 7])) -- cgit v1.2.3