326. Power of Three（LeetCode）

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

Follow up:
Could you do it without using any loop / recursion?

 1 class Solution {
 2 public:
 3     bool isPowerOfThree(int n) {
 4           if (n == 0)
 5             return false;
 6         while (n != 1)
 7         {
 8             if (n % 3 != 0)
 9                 break;
10             else
11             {
12                 n = n / 3;
13             }
14         }
15         if (n == 1)
16             return true;
17         else
18             return false;
19     }
20 };