Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Aprenda Description and Simple Example | Greedy Algorithms: Overview and Examples
Greedy Algorithms using Python

book
Description and Simple Example

Imagine you have n items of size items[i] each one. Your goal is to put as many items as possible in the box of size N, i. e. choose some objects whose summary size is less or equal to size of the box N.

It's not so hard to understand that you have to choose smaller items first, and you can do it until there is an empty place. If you have items = [2, 1, 5, 5, 3, 7, 6] and N = 13, you put items of size 1, 2, 3, 5 and receive 4 items in the box. You can’t put any other item, because left empty space has size 2 and it is not enough. The smaller item you choose every time, the more space is left, and the more other items you can put in.

So, the algorithm is following:

def maxItems(items, n):
items.sort() # reorder items in ascending order
ans = 0
for item in items:
n -= item # reduce the empty space
if n < 0:
break
ans+=1 # if some empty space left, item is added
return ans

12345678910
def maxItems(items, n): items.sort() # reorder items in ascending order ans = 0 for item in items: n -= item # reduce the empty space if n < 0: break ans+=1 # if some empty space left, item is added return ans
copy
Tarefa

Swipe to start coding

Change maxItems() function to return not the number of items, but the list of items, that should be added to the box.

Solução

def maxItems(items, n):
items.sort() # reorder items in ascending order
ans = []
for item in items:
n -= item # reduce the empty space
if n < 0:
break
ans.append(item) # if some empty space left, item is added
return ans

Tudo estava claro?

Como podemos melhorá-lo?

Obrigado pelo seu feedback!

Seção 1. Capítulo 2
single

single

def maxItems(items, n):
items.sort() # reorder items in ascending order
ans = 0
for item in items:
n -= item # reduce the empty space
if n < 0:
break
ans+=1 # if some empty space left, item is added
return ans

items = (2, 1, 5, 5, 3, 7, 6)
n = 13
# call maxItems() and print the answer

Pergunte à IA

expand

Pergunte à IA

ChatGPT

Pergunte o que quiser ou experimente uma das perguntas sugeridas para iniciar nosso bate-papo

some-alt