码迷,mamicode.com
首页 > 其他好文 > 详细

每天一道LeetCode--326. Power of Three

时间:2016-11-22 12:18:38      阅读:140      评论:0      收藏:0      [点我收藏+]

标签:could   style   public   nbsp   oop   cti   code   determine   write   

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) {
        int num=n;
        while(num>0&&num%3==0)
            num/=3;
            return num==1;
    }
    //return n > 0 && (1162261467 % n == 0);
}

 

每天一道LeetCode--326. Power of Three

标签:could   style   public   nbsp   oop   cti   code   determine   write   

原文地址:http://www.cnblogs.com/xiaoduc-org/p/6088468.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!