codility solution for frog jump in java

solution for frog jump java

// Task is to find out how many jumps is needed to get from distance X to Y. Length of every jump is D.
it is one of codility tasks
class Solution {
    // X = beginning, Y = finish, D = distance
    public int solution(int X, int Y, int D) {

        int state = X;
        int count = 0;
        while (state < Y) {
            state = state + D;
            count++;
        }
        return count;
    }

    public static void main(String[] args) {
        int X = 10;
        int Y = 90;
        int D = 30;
        
    }
}

Or you can do it without any loop, e.x.:
public int solution(int X, int Y, int D) {
return (Y-X) % D == 0? (Y-X) / D : (Y-X) /D +1;
}
if the distance (Y-X) is divisible by the jump (D) the frog can make it in distance/jump moves otherwise it has to make one more jump.