You are viewing a single comment's thread. Return to all comments →
def jumpingOnClouds(c): shortest = len(c) - 1 i = 0 while i<len(c)-2: if c[i+2] == 0: shortest -= 1 i+=2 else: i+=1 return shortest
Seems like cookies are disabled on this browser, please enable them to open this website
Jumping on the Clouds
You are viewing a single comment's thread. Return to all comments →
Python solution