Package g1901_2000.s1952_three_divisors
Class Solution
java.lang.Object
g1901_2000.s1952_three_divisors.Solution
1952 - Three Divisors.<p>Easy</p>
<p>Given an integer <code>n</code>, return <code>true</code> <em>if</em> <code>n</code> <em>has <strong>exactly three positive divisors</strong>. Otherwise, return</em> <code>false</code>.</p>
<p>An integer <code>m</code> is a <strong>divisor</strong> of <code>n</code> if there exists an integer <code>k</code> such that <code>n = k * m</code>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> n = 2</p>
<p><strong>Output:</strong> false</p>
<p><strong>Explantion:</strong> 2 has only two divisors: 1 and 2.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> n = 4</p>
<p><strong>Output:</strong> true</p>
<p><strong>Explantion:</strong> 4 has three divisors: 1, 2, and 4.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= n <= 10<sup>4</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
isThree
public boolean isThree(int n)
-