g1901_2000.s1952_three_divisors.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g1901_2000.s1952_three_divisors;

// #Easy #Math #2022_05_18_Time_1_ms_(84.91%)_Space_39.4_MB_(79.95%)

/**
 * 1952 - Three Divisors\.
 *
 * Easy
 *
 * 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:**
 *
 * *   1 <= n <= 10⁴
**/
public class Solution {
    public boolean isThree(int n) {
        int divisors = 0;
        for (int i = 1; i <= n; i++) {
            if (n % i == 0) {
                divisors++;
            }
        }
        return divisors == 3;
    }
}