Today I have done leetcode's August LeetCoding Challenge with cpp.

August LeetCoding Challenge 13

Description

Power of Three

Given an integer n, return true if it is a power of three. Otherwise, return false.

An integer n is a power of three, if there exists an integer x such that n == 3x.

 

Example 1:

Input: n = 27
Output: true
Explanation: 27 = 33

Example 2:

Input: n = 0
Output: false
Explanation: There is no x where 3x = 0.

Example 3:

Input: n = -1
Output: false
Explanation: There is no x where 3x = (-1).

 

Constraints:

• -231 <= n <= 231 - 1

 

Follow up: Could you solve it without loops/recursion?

Solution

class Solution {
public:
  bool isPowerOfThree(int n) {
    return n > 0 && 1162261467 % n == 0;
  }
};

// Accepted
// 21040/21040 cases passed (8 ms)
// Your runtime beats 16.56 % of cpp submissions
// Your memory usage beats 76.82 % of cpp submissions (8.8 MB)