[Leetcode] Power of Three
2016-09-16 17:27
162 查看
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?
public class Solution {
public boolean isPowerOfThree(int n) {
if(n<1) return false;
while(n>2)
{
if((n%3)==1||(n%3)==2) return false;
else n=n/3;
}
if(n==1) return true;
else return false;
}
}
Follow up:
Could you do it without using any loop / recursion?
public class Solution {
public boolean isPowerOfThree(int n) {
if(n<1) return false;
while(n>2)
{
if((n%3)==1||(n%3)==2) return false;
else n=n/3;
}
if(n==1) return true;
else return false;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode Power of Three
- [python语法巩固][leetcode326][Power of Three]
- LeetCode 326 Power of Three（3的幂）（递归、Log函数）
- LeetCode -- Power of Three
- LEETCODE--Power of Three
- Leetcode: Power of Three
- 【LeetCode-326】Power of three 下(C++)
- LeetCode 326:Power of Three
- [LeetCode] Power of Three 判断3的次方数
- [LeetCode][JavaScript]Power of Three
- LeetCode Power of Three
- Leetcode230: Power of Three
- leetcode笔记：Power of Three
- leetcode之power of three
- LeetCode题解——Power of Three
- leetcode 326 Power of Three (python)
- leetcode-326-Power of Three
- [LeetCode 326] Power of Three
- 【leetcode】Power of Three
- [LeetCode] Power of Three | Power of Two