题目：

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

代码：

/**

* @param {number} num

* @return {number}

*/

var findComplement = function(num) {

var n = 1;

while (n <= num) {

n *= 2

}

return ((n - 1) ^ num);

};

[位运算]LeetCode 476. Number Comple
题目：476.Number Complement Given a positive integer, output...
Bit Operation, Add Binary and La
Leetcode 476. Number Complement 思路 java - int - 32 bit 找到...
#476 Number Complement
题目： Given a positive integer, output its complement numbe...
476. Number Complement
原题网址：https://leetcode.com/problems/number-complement/desc...
476. Number Complement
题目分析题目链接，登录 LeetCode 后可用这道题目要求是求一个正整数的补数，并且假设正整数的二进制形式不以...
476. Number Complement
Given a positive integer, output its complement number. T...
476. Number Complement
Given a positive integer, output its complement number. T...
476. Number Complement
思路每次得到num二进制最低位，该位如果是0便得到1，如果是1得到0，将该数除2，重复上述步骤直到为0。代码
476. Number Complement
有想法，但是没有这个简练 Java，用到了库函数注意这里+运算优先于<<运算，所以要加括号。
476. Number Complement
主要内容： Leetcode题目，类型[Bit Manipulation] Java语言实现题目 Given a...