Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
sorting solution in Creative category for Min and Max by kendriu
def sort(*args, **kwargs):
key = kwargs.get("key", None)
reverse = kwargs.get('reverse', False)
values = args[0] if len(args) == 1 else args
return sorted(values, key=key, reverse=reverse)
def min(*args, **kwargs):
return sort(*args, **kwargs)[0]
def max(*args, **kwargs):
key = kwargs.get("key", None)
return sort(*args,reverse = True, **kwargs)[0]
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"
Aug. 31, 2014
