Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
gcd solution in Clear category for Evenly Spaced Trees by marcopunteri
from typing import List
from math import gcd
def evenly_spaced_trees(trees: List[int]) -> int:
target_space = gcd(*[b-a for a,b in zip(trees[:-1],trees[1:])])
return sum(((b-a)/target_space)-1 for a,b in zip(trees[:-1],trees[1:]))
if __name__ == '__main__':
print("Example:")
print(evenly_spaced_trees([0, 2, 6]))
assert evenly_spaced_trees([0, 2, 6]) == 1, 'add 1'
assert evenly_spaced_trees([1, 3, 6]) == 3, 'add 3'
assert evenly_spaced_trees([0, 2, 4]) == 0, 'no add'
print("Coding complete? Click 'Check' to earn cool rewards!")
Jan. 4, 2022
Comments:
