Greatest Common Divisor

• Time : $O(log(min(A,B)))$
• Space : $O(1)$

int Solution::gcd(int A, int B) {
    return !B ? A : gcd(B, A % B);
}