326. Power of Three【E】【81】

最新推荐文章于 2024-07-19 17:22:59 发布

sscssz

最新推荐文章于 2024-07-19 17:22:59 发布

阅读量421

点赞数

本文链接：https://blog.csdn.net/sscssz/article/details/50663202

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

算法

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

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

class Solution(object):
    def isPowerOfThree(self, n):
        if n == 0:
            return False
        if n == 1:
            return True
        if n % 3 != 0:
            return False
        return self.isPowerOfThree(n/3)
        
        
        '''这个方法就比较流氓了，找到32位最大的3的幂
        if n <= 0:
            return False
        else:
            return 1162261467 % n == 0
        '''
        
        #while n > 0:
            
        
        
        """
        :type n: int
        :rtype: bool
        """