首页 > 其他 > 详细

LeetCode-Power of Three

时间:2016-07-19 09:32:14      阅读:212      评论:0      收藏:0      [点我收藏+]
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 {
    private static final double epsilon=10e-15;
    public boolean isPowerOfThree(int n) {
        
        if(n<=0){return false;}
        if(n==1){return true;}
        double res=Math.log(n)/Math.log(3);
        return Math.abs(res - Math.round(res)) < epsilon;
    }
}

 

LeetCode-Power of Three

原文:http://www.cnblogs.com/incrediblechangshuo/p/5683302.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!