Sponsored
Sponsored
This approach leverages the fact that if a number n is a power of three, it should be divisible by 3 repeatedly until it becomes 1. If at any step, n is not divisible by 3 and it's greater than 1, it cannot be a power of three.
Time Complexity: O(log n)
Space Complexity: O(1)
1function isPowerOfThree(n) {
2 if (n < 1) return false;
3 while (n % 3 === 0) {
4 n /= 3;
5 }
6 return n === 1;
7}JavaScript's while loop is utilized to continually divide n by 3 until reaching 1 or finding it undividable by 3.
This approach uses logarithms to determine if a number is a power of three. By taking the logarithm of the number and comparing it to the logarithm base 3, we can check if they form an integer ratio.
Time Complexity: O(1)
Space Complexity: O(1)
1public This Java method uses Math.log10() to compute the logarithmic check for powers of three, ensuring precision.