幾個常見算法的整理

1.gcd算法ios int gcd(int a, int b) { return (a==0)?b:gcd(b%a, a); } //遞推法 int gcd(int m, int n) { while(m>0) { int c = n % m; n = m; m = c; }

>>阅读原文<<