2019.3.25
class PrimeIterator{
private int limit;
private int current = 2;
public PrimeIterator(){
}
public PrimeIterator(int limit){
this.limit = limit;
}
public boolean hasNext(){
return current <= limit;
}
public int next(){
int ret = current;
current++;
while (!checkPrime(current)){
current++;
}
return ret;
}
private boolean checkPrime(int number){
for(int i=2;i<= number/2;i++){
if(number % i == 0){
return false;
}
}
return true;
}
}