[Codility] [12–1] ChocolatesByNumbers（score 100%）

Charlie Chen (陳慶裕)

·

Follow

Dec 15, 2021

--

Share

【Lesson 12–1】: ChocolatesByNumbers 求最小公倍數（score 100%）

public static int ChocolatesByNumbers(int N, int M){return N / gcd(N, M);}public static int gcd(int A, int B){if (A % B == 0)return B;elsereturn gcd(B, A % B);}