首页 > 其他 > 详细

[?]*Power of Three

时间:2016-01-12 09:52:18      阅读:113      评论: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 {
    public boolean isPowerOfThree(int n) 
    {
        return n == 0 ? false : n == Math.pow(3, Math.round(Math.log(n) / Math.log(3)));
    }
}

reference: https://leetcode.com/discuss/78481/java-one-line-solution-using-math-knowledge

[?]*Power of Three

原文:http://www.cnblogs.com/hygeia/p/5123221.html

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