leetcode 326. Power of Three(3的次方)
来源:互联网 发布:看黄子片哪个软件安全 编辑:程序博客网 时间:2024/05/16 07:47
问题描述:
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?
首先,考虑最简单的做法,不断的除以3去进行验证,代码如下:
class Solution { public boolean isPowerOfThree(int n) { if(n == 0) return false; while(n != 1){ if(n % 3 != 0) return false; n = n / 3; } return true; }}
但是,题目里面有提到,能够不用循环进行解答?由于输入的是int类型,最大的3的次方数为3^19=1162261467,所以只要判断这个数能不能被要判断的数整除即可。代码如下:
class Solution { public boolean isPowerOfThree(int n) { if(n == 0) return false; return (n > 0 && 1162261467 % n == 0); }}
阅读全文
0 0
- leetcode 326. Power of Three(3的次方)
- Power of Four and Power of Three - 4的次方和3的次方
- leetcode_326. Power of Three-判断是否3的次方
- leetcode 326. Power of Three 3的幂指数
- 【LeetCode】326. Power of Three (优雅的数学解法)
- [leetcode]326. Power of Three
- Leetcode 326. Power of Three
- Leetcode 326. Power of Three
- [leetcode] - 326. Power of Three
- 326. Power of Three LeetCode
- LeetCode ||326. Power of Three
- [LeetCode]326. Power of Three
- [leetcode] 326. Power of Three
- LeetCode *** 326. Power of Three
- leetcode 326. Power of Three
- 326.[LeetCode]Power Of Three
- LeetCode 326. Power of Three
- #leetcode#326. Power of Three
- Mac 查看目录的方式
- 莫名其妙的问题
- ASCII字符显示例子
- 登陆界面
- JS复制网页内容自带版权信息
- leetcode 326. Power of Three(3的次方)
- ListView的多条目加载
- Java 并发专题 : Semaphore 实现 互斥 与 连接池
- tf中graph定义
- Liunx安装gogs,mysql,jdk,tomcat等常用软件
- 「数据库-SQL」SQL语句 in 超过1000个元素解决方案
- 每日练习|Day015
- GRASP模式
- Hadoop Shell命令