leetcode 326 Power of Three(难易度：Easy)

Power of Three

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

Follow up:
Could you do it without using any loop / recursion?

代码：

bool isPowerOfThree(int n) {
    if (n <= 0)
		return false;
	if (n == 1)
		return true;
	while (n % 3 == 0)
		n /= 3;
	return n == 1;
}

原题地址： https://leetcode.com/problems/power-of-three/