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 welv
def min(*args, **kwargs):
mkey = kwargs.get("key", None)
if len(args) == 1:
largs = list(args[0])
else:
largs = list(args)
largs = sorted(largs, key = mkey)
vmin = largs[0]
return vmin
def max(*args, **kwargs):
mkey = kwargs.get("key", None)
if len(args) == 1:
largs = list(args[0])
else:
largs = list(args)
if mkey != None:
vmax = None
for item in largs:
if vmax == None or mkey(item) > mkey(vmax):
vmax = item
else:
largs = sorted(largs, key = mkey)
vmax = largs[-1]
return vmax
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"
Jan. 20, 2017
