Python 基础知识简单

自守数

“自同构数”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 is_automorphic(n) ,它接受非负整数 n ,如果 n 是自同构数,则返回 True ,否则返回 False 。自守数是其平方以该数本身结尾的数。例如,25 是自同构,因为 25^2 = 625,以 25 结尾。

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

示例

Example 1
Input
n = 25
Output
True
Explanation

25^2 = 625. The last two digits of 625 are 25, which matches n.

Example 2
Input
n = 76
Output
True
Explanation

76^2 = 5776. The last two digits of 5776 are 76, which matches n.

Example 3
Input
n = 13
Output
False
Explanation

13^2 = 169. The last two digits of 169 are 69, which does not match 13.

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

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