15算法课程 326. 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?


solution:

一行代码解决


code:

class Solution {
public:
bool isPowerOfThree(int n) {
        return (n > 0 && 1162261467 % n == 0);
}
};


猜你喜欢

转载自blog.csdn.net/QingJiuYou/article/details/78877563