• Home
• com.github.javadev
• leetcode-in-java21
• 1.30
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1901_2000.s1952_three_divisors.readme.md Maven / Gradle / Ivy

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 <= 104