How would you progrma this function? I think you maybe write like this:
How would you program this function? I think you maybe write like this:
```java
intcountPrimes(intn){
...
...
@@ -148,4 +148,4 @@ int countPrimes(int n) {
In parentheses, ther is the inverse of the prime number .The final result is O(N * loglogN),and readers interested in this can refer to the time complexity of the algorithm
That is all about how to find prime Numbers.The seemingly simple problem does has a lot of details to polish
\ No newline at end of file
That is all about how to find prime Numbers.The seemingly simple problem does has a lot of details to polish