C# LeetCode刷题 - LeetCode204. Count Primes - 题解

版权声明: 本文为博主Bravo Yeung(知乎UserName同名)的原创文章,欲转载请先私信获博主允许,转载时请附上网址
http://blog.csdn.net/lzuacm。

Leetcode 204. Count Primes

在线提交:
https://leetcode.com/problems/count-primes/description/

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

Example:

Input: 10
Output: 4
Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.

  ●  Difficulty: Easy
  • Total Accepted: 160.4K

  • Total Submissions: 602.6K

  • Contributor: mith

你可能感兴趣的:(算法的C#实现)