Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
min, max solution in Clear category for The Fastest Horse by Sim0000
def fastest_horse(horses):
# r is all candidate
r = range(len(horses[0]))
# At first, we make winner list.
winner_list = [min(r, key=race.__getitem__) for race in horses]
# Second, we determine maximum winner.
return max(r, key=winner_list.count) + 1
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert fastest_horse([['1:13', '1:26', '1:11'], ['1:10', '1:18', '1:14'], ['1:20', '1:23', '1:15']]) == 3
March 12, 2018
Comments: