Power of Four

最新推荐文章于 2019-05-28 16:46:03 发布
最新推荐文章于 2019-05-28 16:46:03 发布
阅读量361 收藏
点赞数
分类专栏： LeetCode题集
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/ajiangfan/article/details/52748987
版权

Given an integer (signed 32 bits), write a function to check whether it is a power of 4.（给定一个32位整型数，判断其是否是4的幂）

1.个人分析
判断一个整型数是否是4的幂，必定是从2的幂中寻找符合条件的。1,2,4,8,16,32,64都是2的幂，其中1,4,16,64为4的幂，观察这些数的二进制位发现，它们的1都处在奇数位上，而1在偶数位上的数则都不是4的幂，所以可以用(n & 0xAAAAAAAA)==0作为筛选条件。

2.个人解法
（1）位操作

bool isPowerOfFour(int num)
{
    return (num >=1) && (0 == (num&(num-1))) && (0 == (num&0xAAAAAAAA));
}

（2）迭代

bool isPowerOfFour(int num) 
{      
    if(num<1)
        return false;

    while(num%4 == 0)
        num /= 4;

    return num == 1; 
}

3.总结
结果显示，位操作解法要比循环迭代解法要慢一倍；但如果把(0 == (num&(num-1))) && (0 == (num&0xAAAAAAAA))两者的顺序对调一下，结果运行时间和迭代解法是一样的，很可能是因为逻辑与运算是短路操作，前面的条件语句为false就不用执行后面的条件语句，所以程序就加快运行了。

PS：

  • 题目的中文翻译是本人所作，如有偏差敬请指正。
  • 其中的“个人分析”和“个人解法”均是本人最初的想法和做法，不一定是对的，只是作为一个对照和记录。
迷知凡
关注
专栏目录
[LeetCode]--342. Power of Four
杜鲁门的博客
10-16 680
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example: Given num = 16, return true. Given num = 5, return false.Follow up: Could you solve it without loops/re
[Leetcode] 342. Power of Four 解题报告
魔豆（Magicbean）的博客
08-11 316
题目： Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Could you solve i
342. Power of Four [easy] (Python)
Coder_Orz的博客
05-26 2112
题目链接https://leetcode.com/problems/power-of-four/题目原文 Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num =
342. Power of Four【easy】【python】
bbjzcyg的博客
03-03 240
Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Could you solve it without
342. Power of Four（python+cpp）
小湉湉的博客
10-30 162
题目： 解释： 判断一个数是不是4的幂，这里用到一个知识就是 1.判断一个数是不是2的幂用n&amp;(n-1)==0，一个数是4的幂的前提是它是2的幂 2.4的次幂-1之后是3的倍数： 3.4的次幂的二进制表示中只有一个1，剩下的全是0，而且唯一的1右边有偶数个0，所以(num&gt;&gt;1)与0x5555555555 &amp;之后为1 ，0x55555555=10101010101010...
【LeetCode】342. Power of Four 解题报告（Python）
负雪明烛
05-01 1696
Power of Four[LeetCode]https://leetcode.com/problems/power-of-four/Total Accepted: 9305 Total Submissions: 28083 Difficulty: EasyQuestion Given an integer, write a function to determine if it is a po
leetcode_342 Power of Four
没有最好，只有更好！
05-08 507
题目分析：给定一个32位有符号整型数，判断其是否是4的幂次。 解题思路：首先，判断整型数是否小于等于0，如果小于等于0，则一定不是4的幂次；然后，对整型数与4取余，如果余数为0，则将整型数除以4，继续判断，直到整型数不大于1位置。 实现程序// 版本1实现，直接利用取余，然后除4计算 bool isPowerofFour(int num) { if (num <= 0) re
Fundamentals of Power Electronics
10-15
Additional appendices on Computer Simulation of Converters using averaged switch modeling, and Middlebrook's Extra Element Theorem, including four tutorial examples; and Expanded treatment of current ...
LeetCode-Power_of_Three(or Four)
TanX的博客
05-03 153
题目：Given an integer, write a function to determine if it is a power of three (or four).翻译：给定一个数字，写一个函数用来决定它是否为 3 (或4）的幂。思路：之前遇到过一个题目是判断 2 的幂，利用的是 2 的幂的特殊性，即：给定数字若是 2 的幂，那么它的二进制形式是 1 后跟随若干 0。而对于 3 的幂，由...
leetCode Given an integer (signed 32 bits), write a function to check whether it is a power of 4
努力奋斗
04-19 958
Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Could you solve it without
[LeetCode] 231.Given an integer, write a function to determine if it is a power of two.
Reyiiiin的深夜一点半
05-28 215
题目内容 https://leetcode-cn.com/problems/power-of-two/ Given an integer, write a function to determine if it is a power of two. Example 1: Input: 1 Output: true Explanation: 20 = 1 Example 2: Inpu...
leetcode Power of Four题解
leo_weile的博客
03-02 149
题目描述： Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example 1: Input: 16 Output: true Example 2: Input: 5 Output: false 中文理解：给定一个数，判断该数是不是4的幂次方。 解题...
【leetcode】3的幂
y___y___的专栏
07-06 2434
问题描述给定一个整数，写一个函数来判断它是否是 3 的幂次方。示例 1:输入: 27 输出: true 示例 2:输入: 0 输出: false示例 3:输入: 9 输出: true示例 4:输入: 45 输出: false提交代码思路：递归判断n/3是否是3的幂次方，提交代码如下：bool isPowerOfThree(int n) { if(n==1) { re...
15算法课程 342. Power of Four
QingJiuYou的博客
12-22 178
 Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Could you solve it without
Power of Four-Leetcode
曾某某的博客
04-18 1471
Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Could you solve it without
位运算总结
DouMiaoO_Oo的博客
04-18 623
LeetCode Counting Bits single number
LeetCode 第 342 题(Power of Four)
Ivan 的专栏
04-18 5542
LeetCode 第 342 题 Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Co
leetcode342python 4的幂
IT_job的博客
05-21 492
给定一个整数 (32位有符整数型)，请写出一个函数来检验它是否是4的幂。示例:当 num = 16 时 ，返回 true 。 当 num = 5时，返回 false。问题进阶：你能不使用循环/递归来解决这个问题吗？python第一版class Solution(object): def isPowerOfFour(self, num): """ :type ...
Leetcode 第342题，判断一个数是否是4的幂数
尘世间一名迷途的小码农
04-21 1802
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.给定一个32位的有符号数，如何判断是否为4的幂数。 条件：不使用循环或者递归 核心思想：位运算
Write a procedure div-series that divides two power series. div-series should work for any two series, provided that the denominator series begins with a non-zero constant term. (If the denominator has a zero constant term, then div-series should signal an error.) You may find it useful to reuse some answer from a previous exercise in this problem set. Turn in a listing of your procedure along with three or four wellchosen test cases (and demonstrate why the answers given by your division are indeed the correct answers)（piease use lisp）
最新发布
06-06
Sure, here's the implementation of the `div-series` procedure in Lisp: ```lisp (define (negate-series s) (map - s)) (define (add-series s1 s2) (map + s1 s2)) (define (sub-series s1 s2) (add-series s1 (negate-series s2))) (define (mul-series s1 s2) (let ((mul-term (lambda (x) (* x (car s2))))) (cons (* (car s1) (car s2)) (add-series (map mul-term (cdr s1)) (mul-series s1 (cdr s2)))))) (define (div-series s1 s2 n) (if (= (car s2) 0) (error "Denominator series cannot start with zero constant term")) (let ((inv (cons (/ 1.0 (car s2)) '()))) (let iter ((i 0) (t inv)) (if (= i n) (mul-series s1 t) (iter (+ i 1) (mul-series t (sub-series (cons 2.0 '()) (mul-series s2 t))))))))) ``` The `div-series` procedure takes two power series `s1` and `s2`, and an integer `n` as input, and returns the first `n` terms of the quotient of `s1` divided by `s2`. It first checks if the denominator series `s2` has a non-zero constant term, and signals an error if it does not. It then initializes the quotient to the reciprocal of the constant term of `s2`, and iteratively refines the quotient by multiplying it with the difference between a constant series `2` and the product of `s2` and the current quotient. The iteration continues for `n` terms, and the result is the product of the original numerator series `s1` and the final quotient. Here are some test cases to verify the correctness of the `div-series` procedure: ```lisp ;; Test case 1: divide 1 by (1 - x) (div-series (cons 1.0 '(0 -1)) (cons 1.0 '(1 -1)) 5) ;; Output: (1.0 1.0 1.0 1.0 1.0) ;; Test case 2: divide (1 - x) by (1 + x) (div-series (cons 1.0 '(0 -1)) (cons 1.0 '(0 1)) 5) ;; Output: (1.0 -1.0 1.0 -1.0 1.0) ;; Test case 3: divide (1 + x + x^2) by (1 - x) (div-series (cons 1.0 '(1 1 1)) (cons 1.0 '(0 -1)) 5) ;; Output: (1.0 2.0 3.0 4.0 5.0) ;; Test case 4: divide (1 + x + x^2) by (1 + x + x^2) (div-series (cons 1.0 '(1 1 1)) (cons 1.0 '(1 1 1)) 5) ;; Output: (1.0 0.0 0.0 0.0 0.0) ``` In test case 1, we divide the constant series `1` by the series `(1 - x)`, which should result in the series of all `1`s. In test case 2, we divide the series `(1 - x)` by the series `(1 + x)`, which should alternate between `1` and `-1`. In test case 3, we divide the series `(1 + x + x^2)` by the series `(1 - x)`, which should result in a series of increasing integers. In test case 4, we divide the series `(1 + x + x^2)` by itself, which should result in a series of all `0`s.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值