leetcode python 476

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary rePResentation.

Note:

Example 1:

Input: 5Output: 2Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.
class Solution(object):    def findComplement(self, num):        """        :type num: int        :rtype: int        """        a = bin(num)        print('%s',a)        b = len(a)-2        print('%d',b)        c = pow(2,b)-1        return num ^ c