python中二进制整数_Python程序查找表示二进制整数的必要位数

python中二进制整数

Given an integer number and we have to find necessary bits to represent it in binary in python.

给定一个整数,我们必须找到必要的位以用python二进制表示它

To find necessary bits to represent a number – we use "bit_length()" method of "int" class, it is called with an integer object and returns the total number of bits to require to store/represent an integer number in binary.

为了找到表示数字的必要位,我们使用 int”类的“ bit_length()”方法 ,将其与整数对象一起调用,并返回以二进制存储/表示整数所需的位数。

Note: If the value is 0, bit_length() method returns 0.

注意:如果值为0,则bit_length()方法将返回0。

Example:

例:

    Input:
    num = 67 #binary: 1000011

    # function call
    print(num.bit_length())

    Output:
    7

Python代码查找表示整数的位 (Python code to find bits to represent an integer number)

# Python program to find number of bits 
# necessary to represent an integer in binary

# input a number
num = int(input("Enter an integer number: "))

# total bits to represent number
bits = num.bit_length()

print("bits required to store ", num, " = ", bits)
print("binary value of ", num, " is = ", bin(num))

Output

输出量

First run:
Enter an integer number: 67
bits required to store  67  =  7
binary value of  67  is =  0b1000011

Second run:
Enter an integer number: 3
bits required to store  3  =  2
binary value of  3  is =  0b11


翻译自: https://www.includehelp.com/python/find-number-of-bits-necessary-to-represent-an-integer-in-binary.aspx

python中二进制整数

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值