## Description

https://leetcode.com/problems/power-of-three/

Given an integer, write a function to determine if it is a power of three.

**Example 1:**

Input:27Output:true

**Example 2:**

Input:0Output:false

**Example 3:**

Input:9Output:true

**Example 4:**

Input:45Output:false

**Follow up:**

Could you do it without using any loop / recursion?

## Explanation

keep dividing by three to see if the number is a power of three

## Python Solution

```
class Solution:
def isPowerOfThree(self, n: int) -> bool:
while n > 1:
if n % 3 != 0:
return False
n = n // 3
return n == 1
```

- Time complexity: O(N).
- Space complexity: O(1).

## One Thought to “LeetCode 326. Power of Three”