Skip to content

Instantly share code, notes, and snippets.

@refik
Created January 12, 2015 20:45
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save refik/77981073d7afac09e3f3 to your computer and use it in GitHub Desktop.
Save refik/77981073d7afac09e3f3 to your computer and use it in GitHub Desktop.
tc
class ConnectingCars:
def minimizeCost(self, positions, lengths):
carts = sorted((positions[i], positions[i] + lengths[i]) for i in xrange(len(positions)))
move = lambda i: 0 if i == 0 else (carts[i][0] - carts[i-1][1]) * min(i, len(carts) - i)
return sum(move(i) for i in xrange(len(positions)))
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment