這是你想要的嗎?
public static void getPrime(int n) {
boolean[] arr = new boolean[n+1];
for (int i = 0; i < arr.length; i++) {
arr[i] = isPrime(i);
System.out.println(i + "," + arr[i]);
}
}
public static boolean isPrime(int i) {
if (i == 0) {
return false;
}
for (int j = 2; j < i; j++) {
if (i % j == 0)
return false;
}
return true;
}
如果你想從1到檢查n個質數,或者不是你可以,如果你只需要質數如下
public static void getPrime(int n) {
for (int i = 0; i < n+1; i++) {
System.out.println(i + "," + isPrime(i));
}
}
public static String isPrime(int i) {
if (i == 0) {
return "Not a prime";
}
for (int j = 2; j < i; j++) {
if (i % j == 0)
return "Not a prime";
}
return "prime";
}
做到這一點,你可以做到這一點作爲followa
public static void getPrime(int n) {
for (int i = 0; i < n+1; i++) {
if(isPrime(i))
{
System.out.println(i);
}
}
}
public static boolean isPrime(int i) {
if (i == 0) {
return false;
}
for (int j = 2; j < i; j++) {
if (i % j == 0)
return false;
}
return true;
}
['Arrays#toString(boolean [])'](http://docs.oracle.com/javase/7/docs/api/java/util/Arrays.html#toString%28double []%29) –