[algorithm][leetcode] 326. Power of Three

var isPowerOfThree = function(n) {
    if (n < 1) return false;
    
    while (n % 3 == 0) {
        n = parseInt(n / 3); // is is the fastest lol
        // n = n / 3;
    }
    
    return n === 1;
};

// var isPowerOfThree = function(n) {
//     if (n === 1) return true;
//     if (n < 1) return false;
//     return isPowerOfThree(n/3);
// };