微软笔试题-Greatest Common Divisor(non-recursive version)请赐教

[kernelkoder]

Greatest Common Divisor
For two positive integers m and n their greatest common divisor (gcd) is defined as a greatest integer dividing both of them. For instance
gcd(42, 54) = 6
The following recursive function calculates the gcd.
int GCD(int m, int n)
{
int rem = m % n;
return (rem == 0) ? n : GCD(n, rem);
}
The check to see if m and n are positive has been omitted for clarity.
Write a non-recursive version of this function.

[FancyMouse]

这不就是尾递归转非递归么

[小笨和漂向北方]

While (rem=m%n)!=0 n=rem m=n return n 楼主，你这个内核程序员给出的微软面试题貌似都很简单啊！

[li_x1979]

int gcd(int m,int n) { while (true) { if (n == 0) return m; else m = m % n; if (m == 0) return n; else n = n % m; } }

[RiqueZhang]

int gcd(int m, int n)
{
    while (0 != n) {
        int r = m % n;
        m = n;
        n = r;
    }
    return m;
}