Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary rePResentation.
Note: The given integer is guaranteed to fit within the range of a 32-bit signed integer. You could assume no leading zero bit in the integer’s binary representation. Example 1: Input: 5 Output: 2 Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2. Example 2: Input: 1 Output: 0 Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.
如題數字補碼就是求本身的補碼后return其十進制的數。 二進制5 = 101（無視正負位的數->leading bit） 其補碼 010 = 2
class Solution(object): def findComplement(self, num): """ :type num: int :rtype: int """ return (1<<len("{0:b}".format(num)))-1 ^ num首先將補位到和二進制帶leading bits的num相同長度（10000…..）， -1后用^運算符補碼.
新聞熱點
疑難解答
