Easiest Approach of Euclidian GCD


#1

int Solution::gcd(int A, int B) {
if (B == 0)
return A;
return gcd(B, A % B);
}