250. FrogJmp

1. JavaScript

시간 복잡도 :(

function solution(X, Y, D) {
    let jumpCnt = 0;
    let now = X;
    while(now < Y){
        now += D;
        jumpCnt += 1;
    }

    return jumpCnt;
    
}

정해

function solution(X, Y, D) {
    const minDistance = Y - X;
    return minDistance % D ? (Math.floor(minDistance / D) + 1) :  (Math.floor(minDistance / D))
}