【leetcode】Power of Three

最新推荐文章于 2019-03-02 10:35:21 发布

小雨点点点点

最新推荐文章于 2019-03-02 10:35:21 发布

阅读量209

点赞数

分类专栏： Leetcode(easy)

本文链接：https://blog.csdn.net/qq_20976745/article/details/51566582

版权

Leetcode(easy) 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Question

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?

Code

#include<iostream>
using namespace std;

class Solution {
public:
    bool isPowerOfThree(int n) {
        double res = log10(n) / log10(3);
        return (res - (int)res == 0) ? true:false;
    }
};

int main() {
    Solution so;
    int n = 9;
    cout << so.isPowerOfThree(n) << endl;
    system("pause");
    return 0;
}