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 veghadam1991
def min(*args, **kwargs):
key = kwargs.get("key", None)
args = sorted(args, key=key) if len(args) > 1 else sorted(args[0], key=key)
index = 0
min_arg = args[index]
if not key:
return min_arg
while index < len(args) and list(map(key, args))[index] == list(map(key, args))[index+1]:
index += 1
min_arg = args[index]
return min_arg
def max(*args, **kwargs):
key = kwargs.get("key", None)
args = sorted(args, key=key) if len(args) > 1 else sorted(args[0], key=key)
index = len(args)-1
max_arg = args[index]
if not key:
return max_arg
while index > 0 and list(map(key, args))[index] == list(map(key, args))[index-1]:
index -= 1
max_arg = args[index]
return max_arg
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"
Dec. 16, 2015
