文章标题

public List getPrimeNumber(int startNum, int endNum) {
// TODO Auto-generated method stub
List primeNums = new ArrayList();
int i = startNum;
boolean judge = true;
while (i >= startNum && i <= endNum) {
for(int j = 2; j > 1 && j <= Math.sqrt(i); j++){
if(i % j == 0) {
judge = false;
break;
}
}
if(judge == true) {
primeNums.add(new Integer(i));
}
judge = true;
i++;
}
return primeNums;
}