Python 基础知识简单

最大公因数(HCF)

“最高公因数 (HCF)”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 find_hcf(a, b),它接受两个正整数 ab 并返回它们的最高公因数 (HCF)。 HCF 是两个数相除不留余数的最大正整数。

例如,12和18的HCF是6,因为6是能整除12和18的最大数。

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

示例

Example 1
Input
find_hcf(12, 18)
Output
6
Explanation

Factors of 12: 1, 2, 3, 4, 6, 12. Factors of 18: 1, 2, 3, 6, 9, 18. Common factors: 1, 2, 3, 6. Highest is 6.

Example 2
Input
find_hcf(24, 36)
Output
12
Explanation

Factors of 24: 1, 2, 3, 4, 6, 8, 12, 24. Factors of 36: 1, 2, 3, 4, 6, 9, 12, 18, 36. Highest common factor is 12.

Example 3
Input
find_hcf(7, 13)
Output
1
Explanation

7 and 13 are both prime numbers with no common factors other than 1.

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

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