【leetcode】Count Primes

Description:

Count the number of prime numbers less than a non-negative number, n

References:

How Many Primes Are There?

Sieve of Eratosthenes

分析：一开始觉得不难，遍历一遍比n小的整数，判断某个数是不是合数，然后减掉合数的个数。运行时，输入n较大时，超时。于是看到了Sieve of Eratosthenes方法。（http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes）

思路是：从2开始，遍历他的倍数（4，6，8.....），均认为是合数，然后从下一个不是合数的开始重新遍历。

Input: an integer n > 1
 
Let A be an array of Boolean values, indexed by integers 2 to n,
initially all set to true.
 
 for i = 2, 3, 4, ..., not exceeding √n:
  if A[i] is true:
    for j = i2, i2+i, i2+2i, i2+3i, ..., not exceeding n :
      A[j] := false
 
Output: all i such that A[i] is true.

class Solution {
public:
    int countPrimes(int n) {
      <span style="white-space:pre">	</span>vector <int> ve;
	ve.resize(n);
	for (int m=0;m<n;m++)
	{
		ve[m]=1;
		
	}
	for (int i=2;i<n;i++)
	{
		if (ve[i]==1)
		{
			for (int j=2;j<n/i+1;j++)
			{
				if (i*j>n-1)
				{
					continue;
				}
				ve[i*j]=0;
			}
		}	
	}
	int count=0;
	for (int i=2;i<n;i++)
	{
		if(ve[i]==1)
			count++;
	}
	return count;
    }
};

遇到的问题：

1、for (int j=2;j<n/i+1;j++)这一句或许可以调整，间隔变大，降低复杂度。