Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Algorithm to get nearest element solution in Clear category for Nearest Value by NikolayLearn
def nearest_value(values: set, one: int) -> int:
min = values.pop() #Take one element from set
while values:
val = values.pop()
#Comparison two differences of two elements
if abs(min - one) > abs(val - one):
min = val #give smollest to min
elif abs(min - one) == abs(val - one):
if val < min:
min = val
return min
if __name__ == '__main__':
print("Example:")
print(nearest_value({4, 7, 10, 11, 12, 17}, 9))
# These "asserts" are used for self-checking and not for an auto-testing
assert nearest_value({4, 7, 10, 11, 12, 17}, 9) == 10
assert nearest_value({4, 7, 10, 11, 12, 17}, 8) == 7
assert nearest_value({4, 8, 10, 11, 12, 17}, 9) == 8
assert nearest_value({4, 9, 10, 11, 12, 17}, 9) == 9
assert nearest_value({4, 7, 10, 11, 12, 17}, 0) == 4
assert nearest_value({4, 7, 10, 11, 12, 17}, 100) == 17
assert nearest_value({5, 10, 8, 12, 89, 100}, 7) == 8
assert nearest_value({-1, 2, 3}, 0) == -1
print("Coding complete? Click 'Check' to earn cool rewards!")
Aug. 21, 2020
Comments:
