辗转法求最大公约数和最小公倍数

/// <summary>
        /// 求最大公约数
         /// 辗转相除法
          /// </summary>
        /// <param name="num1"></param>
        /// <param name="num2"></param>
        /// <returns></returns>
        public static int getGreatestCommonMeasure(int num1, int num2)
        {
            if (num1 == 0) return Math.Abs(num2);
            if (num2 == 0) return Math.Abs(num1);
            int num3 = 0;
            //insure: num1 >= num2
            if (num1 < num2)
            {
                num3 = num1;
                num1 = num2;
                num2 = num3;
            }
            num3 = num1 % num2;
            while (num3 != 0)
            {
                num1 = num2;
                num2 = num3;
                num3 = num1 % num2;
            }
            return Math.Abs(num2);
        }

        /// <summary>
        /// 求最小公倍数
        /// </summary>
        /// <param name="num1"></param>
        /// <param name="num2"></param>
        /// <returns></returns>
        public static int getLeastCommonMultiple(int num1, int num2)
        {
            int GCM = getGreatestCommonMeasure(num1,num2);
            if (GCM == 0) return 0;
            return num1 * num2 / GCM;
        }