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 grazik
def sort_list(args, key):
if key is None:
for i in range(len(args) - 1):
for j in range(len(args) -1 -i):
if args[j] >= args[j+1]:
args[j], args[j+1] = args[j+1], args[j]
else:
for i in range(len(args) - 1):
for j in range(len(args) -1 -i):
if key(args[j]) >= key(args[j+1]):
args[j], args[j+1] = args[j+1], args[j]
return args
def min(*args, **kwargs):
key = kwargs.get("key", None)
tab = []
try:
for i in range(len(args)):
for j in args[i]:
if len(args) == 1:
tab.append(j)
else:
tab.append(list(j))
except TypeError:
tab = list(args)
tab = sort_list(tab, key)
return tab[0]
def max(*args, **kwargs):
key = kwargs.get("key", None)
tab = []
try:
for i in range(len(args)):
for j in args[i]:
if len(args) == 1:
tab.append(j)
else:
tab.append(list(j))
except TypeError:
tab = list(args)
tab = sort_list(tab, key)
return tab[-1]
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"
Oct. 21, 2016
