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: Revisited
  5. Discussions

Jumping on the Clouds: Revisited

Sort by

recency

|

1176 Discussions

|

  • ricky03
     + 0 comments

    Here is my C# solution The do while loop help in continueing the traversal until the initial point is reached and making the initial jump.

        static int jumpingOnClouds(int[] c, int k) 
    {
        int e =100;
        int n = c.Count();
        int i =0;
        do{
            i = (i+k)%n;
            e--;
            if(c[i]==1)
                e-=2;     
        }while(i!=0);
        return e;
    }

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the explanation here : https://youtu.be/retgbr5jSsg

    int jumpingOnClouds(vector<int> c, int k) {
    int position = 0, energie = 100;
    do{
        position = (position + k) % c.size();
        energie -= 1 + c[position] * 2;
    }while(position != 0);
    return energie;
}

  • pt023150
     + 0 comments
        java 8

    int e = 100;
    for (int i = 1; i <= c.length; i++) {
        int jump = (k * i) % c.length;

        if (jump == 0 && c[jump] == 1) {
            e = e - 3;
            break;
        }
        if (jump == 0) {
            e = e - 1;
            break;

        } else if (c[jump] == 1) {
            e = e - 3;

        } else {
            e = e - 1;
        }

    }
    return e;

  • voronin_ilia
     + 0 comments

    C++ Solution:

    int jumpingOnClouds(vector<int> c, int k) {
  int energy = 100;
  bool started = false;
  
  auto handleJump = [&energy, &started, &k](vector<int> c, int& index) -> bool {
    // costs of jump
    energy--;
    
    // if thunderhead 
    if(c[index] == 1)
      energy-=2;
    
    // calculate index of next cloud
    index += k;
    if(index >= c.size()) index=index%c.size();
    
    if(!started) started = true;
    
    // if reached start cloud
    if(started && index == 0) {
      return false;
    }

    return true;
  };

  int index = 0;
  while(handleJump(c, index)){}

  return energy;
}

  • illogicalsleepi1
     + 0 comments
    def jumpingOnClouds(n, c, k):
    e = 100
    i = 0
    while True:
        i = (i + k) % n
        e -= 1 + 2 * c[i]
        if i == 0:
            break
    return e