We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Jumping on the Clouds
  5. Discussions

Jumping on the Clouds

Sort by

recency

|

3266 Discussions

|

  • richakesharvani2
     + 0 comments

    Python 3

    def jumpingOnClouds(c):

    jump = 0
i = 0
while True:
    if (i+2)<= (len(c)-1) and c[i+2] == 0 :
        jump = jump + 1
        i = i + 2

    elif (i+1)<= len(c)-1:
        i = i + 1
        jump = jump + 1

    else:
        break

return jump

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the explanation here : https://youtu.be/GNof9B-9CN0

    int jumpingOnClouds(vector<int> c) {
    int result = 0, index = 0;
    while(index < c.size() - 1){
        if(c[index + 2] == 1) index++;
        else index+=2;
        result++;
    }
    return result;
}

  • gabriel_almilha1
     + 0 comments

    Python

    This solutions separates constants and variables, allowing for faster execution. The max_index and size are constants, allowing us to only measure the length of the array once. For the solution to be optimal, we need to try to jump the furthest we can. Since the question emphasizes that there's always a possible solution, this means that in case there's a dangerous cloud in position + 2 we can always jump to position + 1 and this will be the minimum number of jumps.

    def jumpingOnClouds(clouds: list[int])-> int:
    position: int = 0
    jumps: int = 0
    size: int = len(clouds)
    max_index: int = size -1
    
    while position < max_index:
        if(
            position + 2 > max_index or
            clouds[position + 2] == 1
        ):
            position += 1
        else:
            position += 2
        jumps += 1
    
    return jumps

  • jjr20060326
     + 0 comments

    Python

    def jumpingOnClouds(c):
    n = len(c)
    i = 0
    jumps = 0
    
    while i < n - 2:
        if c[i+2] == 0:
            i = i +2
        else: 
            i = i +1
        
        jumps = jumps + 1
    
    return jumps +1 if i < n - 1 else jumps

  • robertbielicki
     + 0 comments

    RUST:

    fn jumpingOnClouds(c: &[i32]) -> i32 {
    let n = c.len() - 1;
    let mut jumps = 0;
    let mut position = 0;

    while position < n {
        if position + 2 <= n && c[position + 2] == 0 {
            position += 2;
        } else {
            position += 1;
        }
        jumps += 1;
    }
    jumps
}