326. Power of Three
来源:互联网 发布:用数据脱恐艾滋病 编辑:程序博客网 时间:2024/05/21 06:37
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?
class Solution {public: bool isPowerOfThree(int n) { if(n <=0 || n==2) return false; if(n==1 || n==3) return true; while(n>3){ if(n%3) return false; n = n / 3; if(n==3) return true; if(n==2) return false; } }};
0 0
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- 326. Power of Three
- Caffe学习系列(4):激活层(Activiation Layers)及参数
- Implicit & Explicit Waits in Selenium
- iOS开发 cell重用 封装自定义方法实现
- 算法设计与分析之-最大子段和 (分治)
- Java中类的排序
- 326. Power of Three
- 如何让oracle的select强制走索引
- 欢迎使用CSDN-markdown编辑器
- 关于adb logcat
- firefox插件-HackBar介绍与试用
- 算法(一)---字符串匹配算法
- C#动态操作DataTable(新增行、列、查询行、列等)
- retrofit-rxAndroid-最快最好用的网络请求框架
- 十进制负数转换为二进制、八进制、十六进制