Python 基础知识简单

完美数

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

问题陈述

简单

编写一个函数 is_perfect(n) ,它接受一个正整数 n ,如果它是完美数,则返回 True ,否则返回 False 。完美数是等于其真因数(除该数本身之外的所有因数)之和的数。例如,6 = 1 + 2 + 3。

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

示例

Example 1
Input
n = 6
Output
True
Explanation

The proper divisors of 6 are 1, 2, 3. Their sum is 1 + 2 + 3 = 6.

Example 2
Input
n = 28
Output
True
Explanation

The proper divisors of 28 are 1, 2, 4, 7, 14. Their sum is 1 + 2 + 4 + 7 + 14 = 28.

Example 3
Input
n = 12
Output
False
Explanation

The proper divisors of 12 are 1, 2, 3, 4, 6. Their sum is 16, which is not 12.

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

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