这篇博客详细介绍了LeetCode第1952题——'Three Divisors'的解题思路。文章通过提供具体的例子展示了如何判断一个整数是否有且仅有三个正除数，并给出了相应的Python解题代码。
Question:
Given an integer n, return true if n has exactly three positive divisors. Otherwise, return false.
An integer m is a divisor of n if there exists an integer k such that n = k * m.
Example 1:
Input: n = 2 Output: false Explantion: 2 has only two divisors: 1 and 2.
Example 2:
Input: n = 4 Output: true Explantion: 4 has three divisors: 1, 2, and 4.
Constraints:
订阅专栏 解锁全文
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
