Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Min and Max by lukasz.bogaczynski
def min(*args, **kwargs):
return reduce(determine_items(*args), lambda x, y: x < y, kwargs.get("key", None))
def max(*args, **kwargs):
return reduce(determine_items(*args), lambda x, y: x > y, kwargs.get("key", None))
def determine_items(*args):
items = []
if len(args) > 1:
items = args
else:
items = args[0]
return list(items)
def reduce(items, comparator, key_extractor):
if key_extractor is None:
key_extractor = lambda x: x
best_matching_item = key_extractor(items[0])
best_matching_index = 0
for index, item in enumerate(items):
if comparator(key_extractor(item), best_matching_item):
best_matching_item = item
best_matching_index = index
return items[best_matching_index]
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert max(3, 2) == 3, "Simple case max"
assert min(3, 2) == 2, "Simple case min"
assert max([1, 2, 0, 3, 4]) == 4, "From a list"
assert min("hello") == "e", "From string"
assert max(2.2, 5.6, 5.9, key=int) == 5.6, "Two maximal items"
assert min([[1, 2], [3, 4], [9, 0]], key=lambda x: x[1]) == [9, 0], "lambda key"
print("Coding complete? Click 'Check' to review your tests and earn cool rewards!")
Oct. 19, 2017