给定一个数，判断是否是3的n次方。不要用循环和递归。
Input：4782968
Output：false
Input：27
Output：true
Input：45
Output：false
最简单容易理解的方法就是找出最大的3的n次方，然后除以x。
bool isPowerOfThree2(int n) {
// 3的19次方
return n > 0 && 1162261467 % n == 0;
}
比较奇怪的题目，还有使用log(n)/log(3)的方法，但是精度有问题。
题目 给定一个数，判断是否是3的n次方。不要用循环和递归。 思路 最简单容易理解的方法就是找出最大的3的n次方，然...
3333 three thousand three hundred and thirty three
THREE.js 下载 THREE.js 官方文档 THREE.js 中文基础教程 THREE.MeshLine ...
tri-前缀含义：three; having three;助记词：triangle;tri(three)+angl...
The Three Kingdoms of Smoke and Smoke "Three Kingdoms of ...
Three Passions Three passions, simple but overwhelming st...
Three farmers live in a village. Three of them are rich, ...
Jobs has told three stories. Each of these three stories ...
Three Sighs, Three Basis and a Bowl of Rice What is meant...
In games, we need to eliminate three or three connected v...
本文标题：Leetcode.326.Power of Three
本文链接：https://www.haomeiwen.com/subject/ektunctx.html
网友评论