这是一个测试用的博客,粘贴一段代码用来测试
public static boolean isPrimeBaidu(long n) {
if (n <= 3) {
<span style="white-space:pre"> </span>return n > 1;
} else if (n % 2 == 0 || n % 3 == 0) {
<span style="white-space:pre"> </span>return false;
} else {
<span style="white-space:pre"> </span>for (int i = 5; i * i <= n; i += 6) {
<span style="white-space:pre"> </span>if (n % i == 0 || n % (i + 2) == 0) {
<span style="white-space:pre"> </span>return false;
<span style="white-space:pre"> </span>}
}
<span style="white-space:pre"> </span>return true;
<span style="white-space:pre"> </span>}
}