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;
}
};
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 326. Power of Three
- LeetCode 326. Power of Three
- leetcode 326. Power of Three
- 【leetcode】326. Power of Three
- [leetcode]326. Power of Three(c语言)
- [leetcode]: 326. Power of Three
- LeetCode 326. Power of Three
- LeetCode 326. Power of Three (算法,换底公式)
- [leetcode] 326. Power of Three
- leetcode_326. Power of Three-判断是否3的次方
- [leetcode]-326. Power of Three(C语言)
- Leetcode题解 326. Power of Three
- [Leetcode]326. Power of Three
- 【LeetCode】 326. Power of Three
- Leetcode 326. Power of Three
- leetcode 231. Power of Two & 326. Power of Three & 342. Power of Four
- leetcode 326. Power of Three
- Leetcode——326. Power of Three
- [leetcode] - 326. Power of Three
- leetcode-java-326. Power of Three