luoheng
10/22/2019 - 11:33 AM

n以内的素数数量

// n以内的素数数量
func primeN(n int) int {
	var prime int
	isPrime := make([]bool, n+1)
	for i := 2; i <= n; i++ {
		if !isPrime[i] {
			prime++
		}
		for j := 2 * i; j <= n; j += i {
			isPrime[j] = true
		}
	}
	return prime
}