每天一道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?

public class Solution {
    public boolean isPowerOfThree(int n) {
        int num=n;
        while(num>0&&num%3==0)
            num/=3;
            return num==1;
    }
    //return n > 0 && (1162261467 % n == 0);
}