Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Evenly Spaced Trees by brownie57
from typing import List
from math import gcd
from functools import reduce
def evenly_spaced_trees(trees: List[int]) -> int:
gap = reduce(gcd, [trees[i + 1] - trees[i] for i in range(len(trees) - 1)])
return (trees[-1] - trees[0]) // gap + 1 - len(trees)
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!")
Oct. 24, 2019
Comments:
