Python integer 的所有位的 XOR

Question

I would like to know if an integer's binary representation has an odd number of bits equal to one.

There is a trivial solution by manipulating bytes and using a few shifts but I think that it is more costly than using a XOR of every bits.

Is there a way to manipulate bits directly instead of bytes?

Answer 1

int type is unbounded in python so this could be one way:

number = 34
i = 0
for n in bin(number):
    if n == '1':
        i += 1
if i % 2 == 0:
    print('even')
else:
    print('odd')