[LeetCode]326. Power of Three

Given an integer, write a function to determine if it is a power of three.

思路：乖乖计算出所有可能的结果。。。蓝后判断输入是不是和他们其中的一个相等。。。

public class Solution {
    public boolean isPowerOfThree(int n) {
     return (n == 1 || n == 3 || n == 9 || n == 27 || n == 81 || n == 243 || n == 729 || n == 2187 || n == 6561 || n == 19683 || n == 59049 || n == 177147 || n == 531441 || n == 1594323 || n == 4782969 || n == 14348907 || n == 43046721 || n == 129140163 || n == 387420489 || n == 1162261467);
    }
}