【LeetCode】326. Power of Three

 

Easy

228882FavoriteShare

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

Example 1:

Input: 27
Output: true

Example 2:

Input: 0
Output: false

Example 3:

Input: 9
Output: true

Example 4:

Input: 45
Output: false

解决方案：

class Solution {
    public boolean isPowerOfThree(int n) {
       
    //Java的Int类型为32位范围为-2147483648——2147483647，

    //而3在32位里最大为1162261467(3的19次方)
        //用1162261467取yu
     return n>0&&1162261467%n==0;
       
    }
}