闲的没事写的。
而且执行的过程中发现,ArrayList总是比LinkedList要快
上代码:
package com.fins;
import java.util.ArrayList;
import java.util.List;
public class Test {
public static void main(String[] args) {
getPrimeNumberIn(200000L);
}
public static List getPrimeNumberIn(Long x) {
long start = System.currentTimeMillis();
System.out.println("开始");
// 用于返回的质数合集
ArrayList primeList = new ArrayList<>();
for(long i = 2L; i <= x; i ++) {
if(testPrime(i, primeList)) {
primeList.add(i);
}
if(i % 5000 == 0) {
System.out.println("已判断到" + i + ",当前质数数量" + primeList.size() + ",已用时" + (System.currentTimeMillis() - start) / 1000.0D + "秒");
}
}
System.out.println("结束!用时:" + (System.currentTimeMillis() - start) / 1000.0D + "秒");
System.out.println("质数共:" + primeList.size() + "个");
return primeList;
}
public static boolean testPrime(Long x, ArrayList primeList) {
if(x == 2L) {
return true;
}
for (Long aLong : primeList) {
if (x % aLong == 0)
return false;
}
return true;
}
}



