首页 > itarticle > algorithm notes: leetcode#326 power of three

algorithm notes: leetcode#326 power of three

admin 11月 12, 2020 0

Problem

Solution

Initial thoughts

Python implementation

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

Java implementation

class  {
    public boolean isPowerOfThree(int n) {
        if(n == 0){ return false; }
        if(n == 1){ return true; }
        while(n % 3 == 0){
            if(n == 3){ return true; }
            n /= 3;
        }
        return false;
    }
}

Time complexity

O(log₃N).

Space complexity

O(1).

Links

326. Power of Three
(中文版) 算法笔记: 力扣#326 3的幂