Given an integer, write a function to determine if it is a power of three.
Follow up:
Could you do it without using any loop / recursion?
思路:用int型最大的3的幂的那个数,即3*3*3*3...... %n , 若结果为0,则n为3的幂,否则n不是3的幂。
class Solution {
public:
bool isPowerOfThree(int n) {
if(n<=0)
return false;
else
return 1162261467%n==0;
}
};