题目:
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
Example 2:
Input: n = 0 Output: false
Example 3:
Input: n = 9 Output: true
Example 4:
Input: n = 45 Output: false
Constraints:
-231 <= n <= 231 - 1
Follow up: Could you solve it without loops/recursion?
思路:
求是否是3次幂,常规思路是一直循环3的次方,看是否与给定数相等即可,但是follow up要求无loop。介绍非常规写法:找出在int范围内3的最大次方 -- 1162261467。如果给定数n大于0并且可以模完1162261467,则必是3次方。
代码:
class Solution {
public:
bool isPowerOfThree(int n) {
return n > 0 && 1162261467 % n == 0;
}
};