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?

class Solution {
public:
    bool isPowerOfThree(int n) {
          if (n == 0)
            return false;
        while (n != 1)
        {
            if (n % 3 != 0)
                break;
            else
            {
                n = n / 3;
            }
        }
        if (n == 1)
            return true;
        else
            return false;
    }
};