Codility -4 FrogJmp

( https://app.codility.com/demo/results/trainingNFYT4W-93F/ )

 

Count minimal number of jumps from position X to Y.

 

내 코드

 

public class FrogJmp {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int D = sc.nextInt();
        System.out.println(solution(X, Y, D));
    }
    public static int solution(int X, int Y, int D) {
        if ( X == Y){
            return 0;
        }
        
        if ((Y - X) % D == 0){
            return (Y - X) / D;
        } 
        else {
            return ((Y - X) / D) + 1;
        }
    }
}

 

무조건 반복문으로만 풀려고하지말고

 

최적해를 항상 고민하기