Python 基础知识简单

素数

“素数”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 is_prime(n) ,它接受正整数 n ,如果 n 是素数,则返回 True ,否则返回 False 。素数是大于 1 的数,除了 1 和它本身之外没有其他约数。

约束条件
  • 1 <= n <= 10^6

示例

Example 1
Input
n = 7
Output
True
Explanation

7 is only divisible by 1 and 7, so it is prime.

Example 2
Input
n = 4
Output
False
Explanation

4 is divisible by 2 (4 = 2 × 2), so it is not prime.

Example 3
Input
n = 1
Output
False
Explanation

1 is not considered a prime number by definition.

Need a Hint?
考虑使用特定于基础的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。