Leetcode 326:Power of Three

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?

Credits:

Special thanks to @dietpepsi for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

//给定一个整数，编写函数判断它是否为3的幂
class Solution {
public:
    bool isPowerOfThree(int n) {
        if(n>1)
        {
            while(n%3==0) 
               n=n/3;
        }
        return n==1;
    }
};