leetcode PowerofThree
z
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
public class PowerofThree {
/**
* 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
* Follow up:
* Could you do it without using any loop / recursion?
*/
public boolean isPowerOfThree(int n) {
return true;
}
}