• Home
• com.github.javadev
• leetcode-in-kotlin
• 1.21
• 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.

g0301_0400.s0326_power_of_three.readme.md Maven / Gradle / Ivy

326\. Power of Three

Easy

Given an integer `n`, return _`true` if it is a power of three. Otherwise, return `false`_.

An integer `n` is a power of three, if there exists an integer `x` such that n == 3x.

**Example 1:**

**Input:** n = 27

**Output:** true

**Explanation:** 27 = 33 

**Example 2:**

**Input:** n = 0

**Output:** false

**Explanation:** There is no x where 3x = 0. 

**Example 3:**

**Input:** n = -1

**Output:** false

**Explanation:** There is no x where 3x = (-1). 

**Constraints:**

*   -231 <= n <= 231 - 1

**Follow up:** Could you solve it without loops/recursion?