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 abe.dillon
lt = lambda a,b: ab
def best(args, kwargs, compare):
key = kwargs.get("key", lambda n:n)
it = iter(args[0]) if len(args) < 2 else iter(args)
winner = next(it)
val = key(winner)
for item in it:
k = key(item)
if compare(k, val): val, winner = k, item
return winner
min = lambda *args, **kwargs: best(args, kwargs, lt)
max = lambda *args, **kwargs: best(args, kwargs, gt)
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"
Feb. 21, 2015
