题目
代码部分一(89ms 48.26%)
class Solution {
public boolean isPowerOfThree(int n) {
return n == 1 || n == 3 || n == 9 || n == 27 ||
n == 81 || n == 243 || n == 729 || n == 2187 ||
n == 6561 || n == 19683 || n == 59049 || n == 177147 ||
n == 531441 || n == 1594323 || n == 4782969 || n == 14348907 ||
n == 43046721 || n == 129140163 || n == 387420489 || n == 1162261467;
}
}
代码部分二(81ms 84.80%)
class Solution {
public boolean isPowerOfThree(int n) {
if(n <= 0) return false;
int count = 1;
for(int i = 0; i <= 19; i++){
if(count == n) return true;
count *= 3;
}
return false;
}
}
代码部分三(79ms 86.40%)
class Solution {
public boolean isPowerOfThree(int n) {
return n > 0 && Math.pow(3, 19) % n == 0;
}
}