Learner Level
Implement the method gcd that returns the greatest common divisor of two integers.
Return the greatest common divisor of two non-negative integers. The result is the largest integer that divides both values without a remainder.
The task is designed to test careful handling of edge cases, not only the most common input.
- If one value is zero, return the other value.
- If both values are zero, return
0. - Use repeated remainder reduction for an efficient solution.
Example 1
Input
a (int) =
12b (int) =
18Returns (int)
6Example 2
Input
a (int) =
7b (int) =
13Returns (int)
1Example 3
Input
a (int) =
100b (int) =
25Returns (int)
25Example 4
Input
a (int) =
0b (int) =
9Returns (int)
9Apply the Euclidean algorithm by repeatedly replacing gcd(a, b) with gcd(b, a % b) until the second value becomes zero.
Ready to test your solutionRun Code checks your solution against the test cases.Shift + Enter to run