您的位置:首页 > 其它

leetcode 326. Power of Three

2016-10-04 20:21 381 查看
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?

class Solution {
public:
bool isPowerOfThree(int n) {
if (n < 1) return false;
while(n % 3 == 0){
n = n / 3;
}
return n == 1;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode