Sponsored
Sponsored
This approach involves successively dividing the number n by 4 to check if it results in 1. If n is a power of four, repeatedly dividing it by 4 should eventually reduce it to 1 with no remainder.
Time Complexity: O(log4 n) due to repeated division.
Space Complexity: O(1) because no additional space is used.
1public class Solution {
2 public bool IsPowerOfFour(int n) {
3 if (n <= 0) return false;
4 while (n % 4 == 0) {
5 n /= 4;
6 }
7 return n == 1;
8 }
9}The C# implementation maintains the same logic as other languages, ensuring the efficiency of the iterative division strategy.
This approach harnesses logarithms to determine if a number is a power of four. For a number n to be a power of four, the logarithm base 4 of n should be an integer. Utilizing the change of base formula, this can be checked without directly using base 4 logarithm functions.
Time Complexity: O(1) as logarithmic operations are constant time.
Space Complexity: O(1).
1#include <iostream>
#include <cmath>
bool isPowerOfFour(int n) {
if (n <= 0) return false;
double log_val = log10(n) / log10(4);
return floor(log_val) == log_val;
}The C++ approach leverages the logarithm functions to calculate and validate the power condition as explained above.