Count Primes

题目

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

Example:

Input: 10
Output: 4
Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.

总结

思路一：判断每一个数是不是质数
代码：

class Solution:
    def countPrimes(self, n):
        """
        :type n: int
        :rtype: int
        """
        def isPrime(x):
            for i in range(2, int(x ** 0.5) + 2):
                if x % i == 0:
                    return False
            return True

        count = 0
        if n > 2:
            count = 1
        for i in range(3, n) :
            if isPrime(i):
                count +=1
        return count

思路二：依次判断每个数是否为素数会耗费大量的时间，可以计算出n以内所有的合数，然后统计出素数的数量。
代码：

class Solution:
    def countPrimes(self, n):
        """
        :type n: int
        :rtype: int
        """
        primes = [1] * n
        if n < 3:
            return 0

        primes[0:2] = [0,0]
        for i in range(2, int(n ** 0.5) + 1):
            primes[i * 2::i] = [0] * ((n - 1) // i - 1)
        return sum(primes)