Jumping On Clouds- Hacker Rank

Jumping On Clouds

Emma is playing a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. She can jump on any cumulus cloud having a number that is equal to the number of the current cloud plus 1 or 2. She must avoid the thunderheads. Determine the minimum number of jumps it will take Emma to jump from her starting position to the last cloud. It is always possible to win the game.

For each game, Emma will get an array of clouds numbered if they are safe or 1 if they must be avoided. For example, c = [0,1,0,0,0,1,0] indexed from 0…6. The number on each cloud is its index in the list so she must avoid the clouds at indexes 1 and 5. She could follow the following two paths

Input Format

The first line contains an integer n, the total number of clouds. The second line contains n space-separated binary integers describing clouds c[i] where I is integer < n.

Constraints

·        n is integer

·        c has only 1 or 0

·        c[0] = c[n-1] = 0

Output Format

Print the minimum number of jumps needed to win the game.

Sample Input 0

7

0 0 1 0 0 1 0

Sample Output 0

4

Explanation 0:
Emma must avoid c[2] and c[5]. She can win the game with a minimum of  jumps:

Code Python 3:

import math

import os

import random

import re

import sys

# Complete the jumpingOnClouds function below.

def jumpingOnClouds(c):

    jumps, i = 0, 0

    while i < len(c)-1:

        # if 2 cloud jumps

        if i+2 < len(c) and c[i+2] != 1:

            i += 1

        jumps += 1

        i += 1

    return jumps

if __name__ == '__main__':

    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    n = int(input())

    c = list(map(int, input().rstrip().split()))

    result = jumpingOnClouds(c)

I will be back with another exercise soon