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

  • abhilekhde
     + 0 comments

    static int jumpingOnClouds(int[] c, int k) { int en = 0; int i = 0; while((i+k)%c.length != 0){ en++; if(c[i%c.length] == 1){ en = en+2 ;

            }
        i=i+k ;
    }
    if(c[c.length-k] == 1 ) en = en+2;
    en++;
    return 100-en;
}