为了求解最大公约数,常常考虑逆向思考:
private static long gcd(long a, long b) {
// return b == 0 ? a : gcd(b, a % b);
while(a % b != 0){
long mod = a % b;
a = b;
b = mod;
}
return b;
}
为了求解最大公约数,常常考虑逆向思考:
private static long gcd(long a, long b) {
// return b == 0 ? a : gcd(b, a % b);
while(a % b != 0){
long mod = a % b;
a = b;
b = mod;
}
return b;
}