求最大公约数

1

	public static int gcd( int a , int b ) {
		return ( b > 0 ) ? gcd( b , a % b ) : a;
	}

2

	private static int gcd(int a, int b)
	{
		int m = a;
		int n = b;
		int r = 1;
		while(true)
		{
			r = m % n;
			if (r == 0)
			{
				return n;
			}
			else
			{
				m = n;
				n = r;
			}
		}
	}