问题描述如下:
“13195的质因数(或者叫素因子,素因素)为5,7,13和29,求600851475143的最大质因数是多少?”
这里质因数的概念就不赘述了。
给出代码如下:
private static Long getTheLargestPrimeFactor(Long n) {
Long returnFactor = 1L;
for (Long factor = 2L; n > 1; factor++) {
if (n % factor == 0) {
n /= factor;
returnFactor = factor;
while (n % factor == 0) {
n /= factor;
}
}
}
return returnFactor;
}
可以得出答案6857。
判断的条件是不是可以有所变化呢,我们知道一个数的质因数不能大过一个数的平方根,将设一个数为n,其任何质因数primefactor <= n的平方根。
那就可以将判断条件修改,如下:
private static Long getTheLargestPrimeFactor1(Long n) {
Long returnFactor = 1L;
Double LargestFactor = Math.sqrt(n);
for (Long factor = 2L; factor <= LargestFactor; factor++) {
if (n % factor == 0) {
n /= factor;
returnFactor = factor;
while (n % factor == 0) {
n /= factor;
}
}
}
return returnFactor;
}
另外,是不是还有一些其他的方面有所改进呢?
我们考虑到2是所有质因数中唯一的偶数,可以在此方面下功夫,不说什么了,贴代码:
private static Long getTheLargestPrimeFactor2(Long n) {
Long returnFactor = 1L;
Long factor = 2L;
Double LargestFactor = Math.sqrt(n);
if (n % factor == 0) {
n = n / factor;
returnFactor = factor;
while (n % factor == 0) {
n /= factor;
}
} else {
factor = 3L;
}
for (; factor <= LargestFactor; factor += 2) {
if (n % factor == 0) {
n /= factor;
returnFactor = factor;
while (n % factor == 0) {
n /= factor;
}
}
}
return returnFactor;
}
到此结束,请不吝赐教!
@anthor ClumsyBirdZ