題目

Description:

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

Credits: Special thanks to @mithmatt for adding this problem and creating all test cases.

思路

普通的計算素數個數效率太低，這里用空間換時間，搞一個各個數的flag，通過flag來計算素數個數

代碼