Solution (leetcode-in-java 1.20 API)

java.lang.Object
- g0301_0400.s0326_power_of_three.Solution

```
public class Solution
extends Object
```
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 == 3^x.

Example 1:

Input: n = 27

Output: true

Example 2:

Input: n = 0

Output: false

Example 3:

Input: n = 9

Output: true

Constraints:
- -2³¹ <= n <= 2³¹ - 1
Follow up: Could you solve it without loops/recursion?

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean isPowerOfThree(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

isPowerOfThree

public boolean isPowerOfThree(int n)