题目链接:https://leetcode-cn.com/problems/count-primes/
思路:我是暴力一个一个找的~~~,不解释了~~~,哈哈~~~。
上代码:
class Solution {
fun countPrimes(n: Int): Int {
var result = 0
for (i in 2 until n) {
var flag = false
for (j in 2..Math.sqrt(i.toDouble()).toInt()) {
if (i % j == 0) {
flag = true
break
}
}
if (!flag) {
result++
}
}
return result
}
}