Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Sorted solution in Clear category for Min and Max by artemrudenko
# migrated from python 2.7
def _find(args, key, action):
if key is None:
key = lambda x: x
if len(args) == 1:
args = list(args[0])
res = sorted(zip(args, list(map(key, args))), key=lambda x: x[1])
if action == 'min':
return res[0][0]
for orig, keyed in res:
if keyed == res[-1][1]:
return orig
def min(*args, **kwargs):
return _find(args, key=kwargs.get("key", None), action='min')
def max(*args, **kwargs):
return _find(args, key=kwargs.get("key", None), action='max')
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"
Sept. 3, 2014
Comments: