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?
Method:
Power of Three does not follow the similar rule of power of four. We can use log operation to solve this problem. However, attention should be paid to accuracy of numbers.
C++:
class Solution {
public:
bool isPowerOfThree(int n) {
double ans = log10(n)/log10(3);
return ans-int(ans)==0;
}
};
LeetCode 326: Power of Three Given an integer, write a fu...
326. Power of Three 题目：https://leetcode.com/problems/powe...
Given an integer, write a function to determine if it is ...
传入一个整数n，判断它是不是3的次方数。 暴力： 循环或者递归（递归还得用空间） 牛逼且能看懂的方法：（O(1)时...
文章作者：Tyan博客：noahsnail.com | CSDN | 简书 1. Description 2. S...
LeetCode题目链接 注意：凡是以英文出现的，都是题目提供的，包括答案代码里的前几行。 题目： Given a...
题目 给定一个数，判断是否是3的n次方。不要用循环和递归。 思路 最简单容易理解的方法就是找出最大的3的n次方，然...
原题链接https://leetcode.com/problems/power-of-three/ Given a...
326. Power of Three Given an integer, write a function to...
326. Power of Three Given an integer, write a function to...
本文标题：[LeetCode 326] Power of Three
本文链接：https://www.haomeiwen.com/subject/iddhrttx.html
网友评论