Leetcode: 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?

Recursion:

public class Solution {
    public boolean isPowerOfThree(int n) {
        if (n <= 0) return false;
        if (n == 1) return true;
        else if (n%3 == 0) return isPowerOfThree(n/3);
        else return false;
    }
}

Iteration:

public class Solution {
    public boolean isPowerOfThree(int n) {
        if (n <= 0) return false;
        while (n != 1) {
            if (n%3 != 0) break;
            n /= 3;
        }
        return n==1;
    }
}

Math: https://leetcode.com/discuss/78532/a-summary-of-all-solutions

It's all about MATH...

Method 1

Find the maximum integer that is a power of 3 and check if it is a multiple of the given input. (related post)

public boolean isPowerOfThree(int n) {
    return n>0 && Math.pow(3, (int)(Math.log(0x7fffffff)/Math.log(3)))%n==0;
}

Note that

Math.pow(3, (int)(Math.log(0x7fffffff)/Math.log(3)))

returns the maximum integer that is a power of 3

Method 2

If log10(n) / log10(3) returns an int, then n is a power of 3. (original post). But be careful here, you cannot use log (natural log) here, because it will generate round off error.

public boolean isPowerOfThree(int n) {
　　return (Math.log10(n) / Math.log10(3)) % 1 == 0;
}