g0301_0400.s0326_power_of_three.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
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
**Example 2:**
**Input:** n = 0
**Output:** false
**Example 3:**
**Input:** n = 9
**Output:** true
**Constraints:**
* -231 <= n <= 231 - 1
**Follow up:** Could you solve it without loops/recursion?