Python 基础知识简单

给定范围内的素数

“给定范围内的素数”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 primes_in_range(a, b),它接受两个整数 ab(其中 a <= b),并按升序返回 [a, b](含)范围内的所有素数的列表。

约束条件
  • 1 <= a <= b <= 10^4

示例

Example 1
Input
a = 10, b = 30
Output
[11, 13, 17, 19, 23, 29]
Explanation

The prime numbers between 10 and 30 are 11, 13, 17, 19, 23, and 29.

Example 2
Input
a = 1, b = 10
Output
[2, 3, 5, 7]
Explanation

The prime numbers between 1 and 10 are 2, 3, 5, and 7.

Example 3
Input
a = 4, b = 4
Output
[]
Explanation

4 is not prime, so the result is an empty list.

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 资源

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