LeetCode#204 Count Prime

Problem Definition:

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

Hint:

　　Let's start with a isPrime function. To determine if a number is prime, we need to check if it is not divisible by any number less than n.

　　The runtime complexity of isPrime function would be O(n) and hence counting the total prime numbers up to n would be O(n²). Could we do better?

Solution: (筛选法)

　  1.  use square root of n.
     2.  use non-prime numbers as the step
     3.  use i*i as the start.
     4.  use count-- in every loop, avoiding another traversal.

def countPrime(n):
    if n<=2:
        return 0
    if n==3:
        return 1
    prime=[True]*n
    count=n-2
    rt=sqrt(n)
    for i in range(2,rt+1):
        if prime[i]==True:
            for j in xrange(i*i,n,i):
                if prime[j]==True:
                    prime[j]=False
                    count-=1
    return count