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. Number Line Jumps
  5. Discussions

Number Line Jumps

  • masoumeh_jafari1
     + 2 comments

    I think it is better to solve it this way:

    string kangaroo(int x1, int v1, int x2, int v2) {
    // Complete this function
    // x1+m*v1=x2+mv2 => m=(x1-x2)/(v2-v1) , m is steps and
    //m should not be negetive and 
    //remainder should be zero
    int x=x1-x2;
    int v=v2-v1;
    if(v!=0){
        if(x%v==0 && x/v>0){
            return "YES";
        }else {return "NO";}
        
    }else {return "NO";}
    
}

    It works