We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent c947bfe commit 4830de0Copy full SHA for 4830de0
src/leetcodeEasyLevel/_0204countPrimes.java
@@ -4,6 +4,8 @@ public class _0204countPrimes {
4
5
//prime numbers 즉 소수를 찾는 문제
6
public static int countPrimes(int n) {
7
+
8
+ //sol Runtime 13 ms Memory 37.7 MB
9
boolean[] nums = new boolean[n];
10
int primeCount = 0;
11
// 1부터 n까지의 숫자를 true로 초기화한다.
0 commit comments