alg_lettcode.cpp

/* 辗转相除法求最大公约数函数 */ int LeeCode_ZK_GCD_Divisor(int num1, int num2) { int minNum; int maxNum; int tempNum; //比较两个数的大小 minNum = min(num1, num2); maxNum = max(num1, num2); //求余 while (minNum != 0) { tempNum = maxNum % minNum; maxNum = minNum