Power of Three
来源:互联网 发布:免root的手机数据恢复 编辑:程序博客网 时间:2024/06/13 09:46
问题描述:
Given an integer, write a function to determine if it is a power of three.
思路:给定一个整数,判断其是否是3的次幂,也就是求以3为底,n的对数是否是整数,即log3(n),若为整数,返回true,否则返回false,利用,loga(b)=log10(b)/log10(a),来进行转换,判断其是否为整数。
代码:
class Solution {public: bool isPowerOfThree(int n) { return (n > 0 && int(log10(n) / log10(3)) - log10(n) / log10(3) == 0); }};
0 0
- leetcode Power of Three
- Leetcode: Power of Three
- LeetCode Power of Three
- 326. Power of Three
- Leetcode230: Power of Three
- Power of Three
- [leetcode]Power of Three
- LeetCode-Power of Three
- leetcode power of three
- 64. Power of Three
- LeetCode----Power of Three
- 326. Power of Three
- Power of Three
- LEETCODE--Power of Three
- 326. Power of Three
- 【leetcode】Power of Three
- 326. Power of Three
- 326. Power of Three
- jmeter压力测试报告
- GYM 101147 K.Touristic Trip(概率DP)
- input文本域选中后会出现蓝边框。去除方式
- 截取最后一个下划线前面的字符
- Jquery 获取 相同NAME 或者id删除行
- Power of Three
- 网址收藏--开发学习
- C++实验3-多分数段函数求值
- 视频文件格式和视频编码方式的区别
- web安全
- POJ2409 BurnSide 定理的简单应用+轨道 稳定化子定理介绍(不证明)
- UML类图与类的关系详解
- 自用的简单封装ajax,试用初学者
- c++实验3-个人所得税计算器