modify code

Author: algorithmzuo

src/topinterviewquestions/Problem_0204_CountPrimes.java

@@ -12,29 +12,12 @@ public static int countPrimes(int n) {
 			if (f[i]) {
 				continue;
 			}
-
-			// 1
-//			int cur = i;
-//			int j = i;
-//			int p = cur * j;
-//			while (p < n) {
-//				if (!f[p]) {
-//					--count;
-//					f[p] = true;
-//				}
-//				cur += 2;
-//				p = j * cur;
-//			}
-			// 1
-
-			// 2
 			for (int j = i * i; j < n; j += 2 * i) {
 				if (!f[j]) {
 					--count;
 					f[j] = true;
 				}
 			}
-			// 2
 		}
 		return count;
 	}