要求:输出从整数n到整数m(n
boolean[] isPrime = new boolean[m + 1];
2、将数组下标为0和1的元素置为false。
isPrime[1] = false;
isPrime[0] = false;
3、将数组下标从2到m的元素,全部置为 true。
Arrays.fill(isPrime, 2, m + 1, true);
4、排除2,3,4,5,6,…i(i*i<=m)的倍数;
for (int i = 2; i <= m; i++)
//设置数组的boolean值
{
if (isPrime[i])
{
for (int j = i; j * i <= m; j++)
//当i=2时,将2的倍数置为false
//i从2到i*i<=m,将2,3,4,5,6,...i(i*i<=m)的倍数置为false
{
isPrime[j * i] = false;
}
}
}
5、输出值为true的数组下标。完整代码如下:
package com.easy;
import java.util.Arrays;
public class IsPrime
{
public static boolean[] printPrime(int n, int m)
{
boolean[] isPrime = new boolean[m + 1];
isPrime[1] = false;
isPrime[0] = false;
Arrays.fill(isPrime, 2,m + 1, true);
for (int i = 2; i <= m; i++)
{
if (isPrime[i])
{
for (int j = i; j * i <= m; j++)
{
isPrime[j * i] = false;
}
}
}
return isPrime;
}
public static int fun( int n, int m) {
// 个数
int count = 0;
boolean[] isPrime = printPrime(n, m);
for (int i = from; i <= m; i++) {
if (isPrime[i] == true)
{
count++;
System.out.print(i + " ");
}
}
return count;
}
public static void main(String[] args) {
System.out.println(fun(5, 20));
}
}