#-*- coding: UTF-8 -*-
class Solution(object):
def isPowerOfThree(self, n):
if n<=0:
return False
while True:
if n==3 or n==1:
return True
tuple=divmod(n,3)
if tuple[1]!=0:
return False
n=tuple[0]
sol=Solution()
print sol.isPowerOfThree(333)
相关文章
- 【leetcode❤python】326. Power of Three
- LeetCode之旅(20)-Power of Three
- LeetCode 326 Power of Three
- 【LeetCode】1020. Partition Array Into Three Parts With Equal Sum 解题报告(Python)
- [LeetCode] 231 Power of Two && 326 Power of Three && 342 Power of Four
- LeetCode 326 Power of Three(3的幂)(递归、Log函数)
- LeetCode - 326, 342, 231 Power of Three, Four, and Two
- python leetcode 日记--231. Power of Two
- [LeetCode&Python] Problem 628. Maximum Product of Three Numbers
- [LeetCode] Power of Three 判断3的次方数