@@ -0,0 +1,166 @@
+// Greatest Common Divisor%0A%0Apublic int gcd(int a, int b) %7B%0A    return b == 0 ? a : gcd(b, a %25 b);%0A%7D%0A%0Apublic int lcm(int a, int b) %7B%0A    return a * (b / gcd(a, b));%0A%7D%0A

add java solution for gcd