We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent ec89a8a commit bf241b0Copy full SHA for bf241b0
src/CountPrimes.java
@@ -1,3 +1,7 @@
1
+// https://leetcode.com/problems/count-primes
2
+// T: O(n log(log(n)))
3
+// S: O(n)
4
+
5
public class CountPrimes {
6
7
public static int countPrimes(int number) {
0 commit comments