Power of Three
来源:互联网 发布:多客户端访问数据库 编辑:程序博客网 时间:2024/06/05 12:39
这个掌握最基本的迭代就好。
public class Solution { public boolean isPowerOfThree(int n) { if (n == 0) { return false; } return n == Math.pow(3, Math.round(Math.log(n)/Math.log(3))); } // public boolean isPowerOfThree(int n) { // while (n > 0 && n % 3 == 0) { // n = n/3; // } // return n == 1; // }}
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
- EventBus原理详解
- 多重背包问题
- 网络虚拟化之FlowVisor—网络虚拟层(上)
- Linux学习方法论
- MPAndroidChart使用一之圆饼图
- Power of Three
- UML反向工程方法
- 常用排序算法之希尔排序
- 基于v4l2的视频监控
- leetcode 182. Duplicate Emails
- 网络虚拟化之FlowVisor:网络虚拟层(中)
- 解决windows,linux启动问题
- STM32学习-定时器中断实验
- HTTP报文