Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Use sort - UPDATE: max should use reverse=True solution in Clear category for Min and Max by heitor
def min(*args, **kwargs):
if len(args) == 1:
args = args[0]
key = kwargs.get("key", lambda x: x)
return sorted(args, key=key)[0]
def max(*args, **kwargs):
if len(args) == 1:
args = args[0]
key = kwargs.get("key", lambda x: x)
s = sorted(args, key=key)
maxS = key(s[-1])
return [elem for elem in s if key(elem) == maxS][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"
July 22, 2017
Comments:
