326. Power of Three

最新推荐文章于 2023-12-17 00:04:34 发布

zoojing

最新推荐文章于 2023-12-17 00:04:34 发布

阅读量115

点赞数

分类专栏： leetcode python 文章标签： python leetcode

本文链接：https://blog.csdn.net/zoojing/article/details/51219152

版权

python 同时被 2 个专栏收录

60 篇文章 0 订阅

订阅专栏

leetcode

44 篇文章 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?

Python:

class Solution(object):
def isPowerOfThree(self, n):
    """
    :type n: int
    :rtype: bool
    """
    #循环
    if n <= 0:
        return False
    while n % 3 == 0:
        n = n / 3
    return n == 1

    #非循环
    #>>> math.log(243,3)
    #4.999999999999999
    if n <= 0:
        return False
    import sys
    import math
    max_num = pow(3, int(math.log(sys.maxint, 3)))
    return max_num % n == 0