Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Bigger Price by C.Fred
def bigger_price(limit: int, data: list) -> list:
"""
TOP most expensive goods
"""
#Why reinvent the wheel? Python has a sort() function
#reverse = True to sort high-to-low
#key is what we're sorting on: a function where for each list item, x, we want x["price"]
#(The lambda function is how we do that mapping)
data.sort(reverse = True, key = lambda x: x["price"])
#And we just need the first limit items of the list
return data[:limit]
if __name__ == '__main__':
from pprint import pprint
print('Example:')
pprint(bigger_price(2, [
{"name": "bread", "price": 100},
{"name": "wine", "price": 138},
{"name": "meat", "price": 15},
{"name": "water", "price": 1}
]))
# These "asserts" using for self-checking and not for auto-testing
assert bigger_price(2, [
{"name": "bread", "price": 100},
{"name": "wine", "price": 138},
{"name": "meat", "price": 15},
{"name": "water", "price": 1}
]) == [
{"name": "wine", "price": 138},
{"name": "bread", "price": 100}
], "First"
assert bigger_price(1, [
{"name": "pen", "price": 5},
{"name": "whiteboard", "price": 170}
]) == [{"name": "whiteboard", "price": 170}], "Second"
print('Done! Looks like it is fine. Go and check it')
July 27, 2021
