方法一:
class Solution {
public int recursion(int n){
if(n>=3){
if(n%3==0){
return recursion(n/3);
}else{
return n;
}
}else{
return n;
}
}
public boolean isPowerOfThree(int n) {
int result = recursion(n);
return result==1?true:false;
}
}
方法二:
class Solution {
public boolean isPowerOfThree(int n) {
if(n < 1){
return false;
}
while(n>1){
if(n % 3 != 0){
return false;
}
n /= 3;
}
return true;
}
}