如果有相应的OJ题目,欢迎同学们提供相应的链接
None
/* * TIME complexity:O(logN) means very fast. * PARAMS: * a Integer a. * b Integer b. */ int gcd(int a,int b){ return a%b==0?b:gcd(b,a%b); }