Package g1901_2000.s1952_three_divisors

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • <code>1 <= n <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean isThree(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait