wanngwe/Learn-Algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
d1ad2f3dbb992e23eb7a47be4cfe44f61511765a
Learn-Algorithms/9 Algorithms Job Interview/4.5 数值-素树.md
T
ranwenjie d1ad2f3dbb update sequence
2021-09-13 11:36:49 +08:00

184 B
Raw Blame History

数值-素树

如果一个数如果只能被 1 和它本身整除，那么这个数就是素数

返回区间 [2, n) 中有几个素数

int countPrimes(int n)
Reference in New Issue View Git Blame Copy Permalink