Time: 409 ms (29.51%), Space: 10.2 MB (70.29%) - LeetHub

Author: anand-3399

204-count-primes/204-count-primes.cpp

@@ -1,18 +1,23 @@
 class Solution {
 public:
     int countPrimes(int n) {
+        
         int cnt = 0;
+        
         vector<bool> prime(n+1, true);
 
         prime[0] = prime[1] = false;
 
         for(int i=2; i<n; i++){
 
             if(prime[i]){
+                
                 cnt++;
 
                 for(int j=2*i; j<n; j = j+i){
+                    
                     prime[j] = 0;
+                    
                 }
             }